/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 14:59:33,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 14:59:33,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 14:59:33,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 14:59:33,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 14:59:33,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 14:59:33,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 14:59:33,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 14:59:33,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 14:59:33,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 14:59:33,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 14:59:33,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 14:59:33,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 14:59:33,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 14:59:33,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 14:59:33,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 14:59:33,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 14:59:33,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 14:59:33,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 14:59:33,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 14:59:33,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 14:59:33,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 14:59:33,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 14:59:33,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 14:59:33,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 14:59:33,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 14:59:33,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 14:59:33,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 14:59:33,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 14:59:33,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 14:59:33,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 14:59:33,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 14:59:33,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 14:59:33,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 14:59:33,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 14:59:33,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 14:59:33,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 14:59:33,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 14:59:33,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 14:59:33,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 14:59:33,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 14:59:33,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 14:59:33,444 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 14:59:33,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 14:59:33,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 14:59:33,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 14:59:33,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 14:59:33,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 14:59:33,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 14:59:33,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 14:59:33,446 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 14:59:33,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 14:59:33,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 14:59:33,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 14:59:33,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 14:59:33,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 14:59:33,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 14:59:33,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 14:59:33,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:59:33,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 14:59:33,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 14:59:33,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 14:59:33,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 14:59:33,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 14:59:33,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 14:59:33,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 14:59:33,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-01 14:59:33,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 14:59:33,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 14:59:33,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 14:59:33,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 14:59:33,677 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 14:59:33,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-03-01 14:59:33,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c362e38ca/0e6741bdf30741d28d0ad53cf06b449a/FLAG1c4682f88 [2022-03-01 14:59:34,196 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 14:59:34,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-03-01 14:59:34,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c362e38ca/0e6741bdf30741d28d0ad53cf06b449a/FLAG1c4682f88 [2022-03-01 14:59:34,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c362e38ca/0e6741bdf30741d28d0ad53cf06b449a [2022-03-01 14:59:34,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 14:59:34,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 14:59:34,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 14:59:34,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 14:59:34,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 14:59:34,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:59:34" (1/1) ... [2022-03-01 14:59:34,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36be831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:34, skipping insertion in model container [2022-03-01 14:59:34,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:59:34" (1/1) ... [2022-03-01 14:59:34,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 14:59:34,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 14:59:34,891 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-01 14:59:35,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39095,39108] [2022-03-01 14:59:35,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39180,39193] [2022-03-01 14:59:35,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39232,39245] [2022-03-01 14:59:35,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49285,49298] [2022-03-01 14:59:35,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49334,49347] [2022-03-01 14:59:35,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49462,49475] [2022-03-01 14:59:35,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49520,49533] [2022-03-01 14:59:35,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:59:35,204 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 14:59:35,216 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-01 14:59:35,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39095,39108] [2022-03-01 14:59:35,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39180,39193] [2022-03-01 14:59:35,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39232,39245] [2022-03-01 14:59:35,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49285,49298] [2022-03-01 14:59:35,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49334,49347] [2022-03-01 14:59:35,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49462,49475] [2022-03-01 14:59:35,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49520,49533] [2022-03-01 14:59:35,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:59:35,288 INFO L208 MainTranslator]: Completed translation [2022-03-01 14:59:35,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35 WrapperNode [2022-03-01 14:59:35,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 14:59:35,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 14:59:35,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 14:59:35,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 14:59:35,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,355 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2022-03-01 14:59:35,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 14:59:35,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 14:59:35,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 14:59:35,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 14:59:35,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 14:59:35,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 14:59:35,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 14:59:35,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 14:59:35,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (1/1) ... [2022-03-01 14:59:35,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:59:35,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:59:35,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 14:59:35,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-03-01 14:59:35,459 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-03-01 14:59:35,459 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 14:59:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 14:59:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 14:59:35,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 14:59:35,461 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 14:59:35,577 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 14:59:35,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 14:59:35,899 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 14:59:35,910 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 14:59:35,910 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-01 14:59:35,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:59:35 BoogieIcfgContainer [2022-03-01 14:59:35,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 14:59:35,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 14:59:35,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 14:59:35,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 14:59:35,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 02:59:34" (1/3) ... [2022-03-01 14:59:35,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2c23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:59:35, skipping insertion in model container [2022-03-01 14:59:35,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:35" (2/3) ... [2022-03-01 14:59:35,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2c23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:59:35, skipping insertion in model container [2022-03-01 14:59:35,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:59:35" (3/3) ... [2022-03-01 14:59:35,920 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-03-01 14:59:35,924 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 14:59:35,924 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 14:59:35,924 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-01 14:59:35,924 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 14:59:35,963 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,972 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,973 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,974 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,981 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,995 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,996 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,997 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,998 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,998 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,998 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,998 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,998 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,998 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,998 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:35,999 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,000 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,001 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,001 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,001 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,001 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,001 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,001 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,002 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,002 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,002 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,003 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,003 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,003 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,003 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,003 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,003 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,004 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,004 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,004 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,005 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,005 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,005 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,005 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,005 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,005 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,005 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,006 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,006 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,006 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,006 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,006 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,007 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,008 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,008 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,008 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,008 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,008 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,009 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,009 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,009 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,009 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,009 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,009 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,011 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,011 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,011 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,011 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,011 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,012 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,013 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,015 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,016 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,016 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,023 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,023 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,024 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,024 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,024 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,025 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,025 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,025 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,025 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,025 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,025 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,026 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,031 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,032 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,033 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,034 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,035 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,036 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,037 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,038 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,039 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,039 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,039 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,039 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,039 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,039 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,042 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,043 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,043 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,043 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,043 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,043 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,044 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,044 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,044 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,044 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,044 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,045 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,046 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,047 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,047 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,047 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,047 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,047 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,048 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:36,050 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-01 14:59:36,078 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 14:59:36,083 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 14:59:36,083 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-03-01 14:59:36,096 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 210 places, 220 transitions, 456 flow [2022-03-01 14:59:38,248 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-01 14:59:38,557 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:38,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:38,558 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:38,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:38,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1408739966, now seen corresponding path program 1 times [2022-03-01 14:59:38,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:38,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926109710] [2022-03-01 14:59:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:59:39,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:39,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926109710] [2022-03-01 14:59:39,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926109710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:39,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:39,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-01 14:59:39,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646164709] [2022-03-01 14:59:39,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:39,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 14:59:39,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 14:59:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-03-01 14:59:39,431 INFO L87 Difference]: Start difference. First operand has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:59:42,198 INFO L93 Difference]: Finished difference Result 101011 states and 310954 transitions. [2022-03-01 14:59:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 14:59:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-03-01 14:59:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:59:42,795 INFO L225 Difference]: With dead ends: 101011 [2022-03-01 14:59:42,795 INFO L226 Difference]: Without dead ends: 100951 [2022-03-01 14:59:42,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 14:59:42,801 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1127 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 14:59:42,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 4283 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 14:59:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100951 states. [2022-03-01 14:59:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100951 to 95266. [2022-03-01 14:59:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95266 states, 95262 states have (on average 3.0807562301862235) internal successors, (293479), 95265 states have internal predecessors, (293479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95266 states to 95266 states and 293479 transitions. [2022-03-01 14:59:46,359 INFO L78 Accepts]: Start accepts. Automaton has 95266 states and 293479 transitions. Word has length 83 [2022-03-01 14:59:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:59:46,360 INFO L470 AbstractCegarLoop]: Abstraction has 95266 states and 293479 transitions. [2022-03-01 14:59:46,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 95266 states and 293479 transitions. [2022-03-01 14:59:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-01 14:59:46,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:46,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:46,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 14:59:46,462 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -176902823, now seen corresponding path program 1 times [2022-03-01 14:59:46,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:46,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817167603] [2022-03-01 14:59:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:59:46,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:46,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817167603] [2022-03-01 14:59:46,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817167603] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:46,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:46,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-01 14:59:46,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978465455] [2022-03-01 14:59:46,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:46,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 14:59:46,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:46,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 14:59:46,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-01 14:59:46,896 INFO L87 Difference]: Start difference. First operand 95266 states and 293479 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:59:50,470 INFO L93 Difference]: Finished difference Result 153195 states and 472281 transitions. [2022-03-01 14:59:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 14:59:50,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-03-01 14:59:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:59:50,986 INFO L225 Difference]: With dead ends: 153195 [2022-03-01 14:59:50,986 INFO L226 Difference]: Without dead ends: 152229 [2022-03-01 14:59:50,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 14:59:50,988 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2688 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 5405 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:59:50,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2688 Valid, 5405 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 14:59:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152229 states. [2022-03-01 14:59:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152229 to 120205. [2022-03-01 14:59:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120205 states, 120201 states have (on average 3.0863803129757654) internal successors, (370986), 120204 states have internal predecessors, (370986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120205 states to 120205 states and 370986 transitions. [2022-03-01 14:59:55,127 INFO L78 Accepts]: Start accepts. Automaton has 120205 states and 370986 transitions. Word has length 88 [2022-03-01 14:59:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:59:55,127 INFO L470 AbstractCegarLoop]: Abstraction has 120205 states and 370986 transitions. [2022-03-01 14:59:55,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 120205 states and 370986 transitions. [2022-03-01 14:59:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-01 14:59:55,204 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:55,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:55,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 14:59:55,205 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 929430313, now seen corresponding path program 2 times [2022-03-01 14:59:55,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:55,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428971042] [2022-03-01 14:59:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:59:55,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:55,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428971042] [2022-03-01 14:59:55,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428971042] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:55,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:55,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-01 14:59:55,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237055886] [2022-03-01 14:59:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:55,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 14:59:55,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 14:59:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-01 14:59:55,611 INFO L87 Difference]: Start difference. First operand 120205 states and 370986 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:59:59,249 INFO L93 Difference]: Finished difference Result 159338 states and 491229 transitions. [2022-03-01 14:59:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 14:59:59,249 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-03-01 14:59:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:59:59,920 INFO L225 Difference]: With dead ends: 159338 [2022-03-01 14:59:59,920 INFO L226 Difference]: Without dead ends: 159086 [2022-03-01 14:59:59,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 14:59:59,921 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2687 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 5439 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 14:59:59,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2687 Valid, 5439 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 15:00:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159086 states. [2022-03-01 15:00:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159086 to 118249. [2022-03-01 15:00:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118249 states, 118245 states have (on average 3.086515286058607) internal successors, (364965), 118248 states have internal predecessors, (364965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118249 states to 118249 states and 364965 transitions. [2022-03-01 15:00:03,843 INFO L78 Accepts]: Start accepts. Automaton has 118249 states and 364965 transitions. Word has length 88 [2022-03-01 15:00:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:03,845 INFO L470 AbstractCegarLoop]: Abstraction has 118249 states and 364965 transitions. [2022-03-01 15:00:03,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 118249 states and 364965 transitions. [2022-03-01 15:00:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-01 15:00:03,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:03,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:03,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 15:00:03,920 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1579355583, now seen corresponding path program 3 times [2022-03-01 15:00:03,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:03,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507799343] [2022-03-01 15:00:03,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:00:04,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:04,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507799343] [2022-03-01 15:00:04,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507799343] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:04,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:04,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-01 15:00:04,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536084588] [2022-03-01 15:00:04,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:04,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 15:00:04,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:04,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 15:00:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-01 15:00:04,269 INFO L87 Difference]: Start difference. First operand 118249 states and 364965 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:07,390 INFO L93 Difference]: Finished difference Result 131753 states and 405812 transitions. [2022-03-01 15:00:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 15:00:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-03-01 15:00:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:07,786 INFO L225 Difference]: With dead ends: 131753 [2022-03-01 15:00:07,786 INFO L226 Difference]: Without dead ends: 131585 [2022-03-01 15:00:07,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 15:00:07,788 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 2374 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:07,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2374 Valid, 5481 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 15:00:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131585 states. [2022-03-01 15:00:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131585 to 111213. [2022-03-01 15:00:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111213 states, 111209 states have (on average 3.0827271174095623) internal successors, (342827), 111212 states have internal predecessors, (342827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111213 states to 111213 states and 342827 transitions. [2022-03-01 15:00:11,415 INFO L78 Accepts]: Start accepts. Automaton has 111213 states and 342827 transitions. Word has length 88 [2022-03-01 15:00:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:11,427 INFO L470 AbstractCegarLoop]: Abstraction has 111213 states and 342827 transitions. [2022-03-01 15:00:11,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 111213 states and 342827 transitions. [2022-03-01 15:00:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:00:11,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:11,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:11,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 15:00:11,531 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:11,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash -903700515, now seen corresponding path program 1 times [2022-03-01 15:00:11,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:11,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718153685] [2022-03-01 15:00:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:00:12,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:12,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718153685] [2022-03-01 15:00:12,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718153685] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:12,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:12,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:00:12,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362398321] [2022-03-01 15:00:12,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:12,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:00:12,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:12,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:00:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:00:12,318 INFO L87 Difference]: Start difference. First operand 111213 states and 342827 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:20,630 INFO L93 Difference]: Finished difference Result 163236 states and 502706 transitions. [2022-03-01 15:00:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:00:20,630 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:00:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:21,131 INFO L225 Difference]: With dead ends: 163236 [2022-03-01 15:00:21,131 INFO L226 Difference]: Without dead ends: 163236 [2022-03-01 15:00:21,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-01 15:00:21,133 INFO L933 BasicCegarLoop]: 1038 mSDtfsCounter, 2940 mSDsluCounter, 9878 mSDsCounter, 0 mSdLazyCounter, 3846 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2940 SdHoareTripleChecker+Valid, 10916 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:21,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2940 Valid, 10916 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3846 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:00:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163236 states. [2022-03-01 15:00:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163236 to 112825. [2022-03-01 15:00:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112825 states, 112821 states have (on average 3.0824935074143998) internal successors, (347770), 112824 states have internal predecessors, (347770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112825 states to 112825 states and 347770 transitions. [2022-03-01 15:00:24,778 INFO L78 Accepts]: Start accepts. Automaton has 112825 states and 347770 transitions. Word has length 105 [2022-03-01 15:00:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:24,779 INFO L470 AbstractCegarLoop]: Abstraction has 112825 states and 347770 transitions. [2022-03-01 15:00:24,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 112825 states and 347770 transitions. [2022-03-01 15:00:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:00:24,900 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:24,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:24,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 15:00:24,901 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash -535260145, now seen corresponding path program 2 times [2022-03-01 15:00:24,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:24,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511429130] [2022-03-01 15:00:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:00:25,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:25,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511429130] [2022-03-01 15:00:25,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511429130] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:25,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:25,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:00:25,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991212553] [2022-03-01 15:00:25,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:25,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:00:25,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:25,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:00:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:00:25,651 INFO L87 Difference]: Start difference. First operand 112825 states and 347770 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:36,152 INFO L93 Difference]: Finished difference Result 170538 states and 525251 transitions. [2022-03-01 15:00:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 15:00:36,153 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:00:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:36,920 INFO L225 Difference]: With dead ends: 170538 [2022-03-01 15:00:36,920 INFO L226 Difference]: Without dead ends: 170538 [2022-03-01 15:00:36,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:00:36,925 INFO L933 BasicCegarLoop]: 1323 mSDtfsCounter, 3249 mSDsluCounter, 11866 mSDsCounter, 0 mSdLazyCounter, 4594 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3249 SdHoareTripleChecker+Valid, 13189 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:36,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3249 Valid, 13189 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4594 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-01 15:00:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170538 states. [2022-03-01 15:00:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170538 to 113321. [2022-03-01 15:00:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113321 states, 113317 states have (on average 3.0827589858538436) internal successors, (349329), 113320 states have internal predecessors, (349329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113321 states to 113321 states and 349329 transitions. [2022-03-01 15:00:40,776 INFO L78 Accepts]: Start accepts. Automaton has 113321 states and 349329 transitions. Word has length 105 [2022-03-01 15:00:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:40,777 INFO L470 AbstractCegarLoop]: Abstraction has 113321 states and 349329 transitions. [2022-03-01 15:00:40,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 113321 states and 349329 transitions. [2022-03-01 15:00:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:00:40,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:40,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:40,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 15:00:40,896 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash -813579587, now seen corresponding path program 3 times [2022-03-01 15:00:40,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:40,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654397618] [2022-03-01 15:00:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:00:41,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:41,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654397618] [2022-03-01 15:00:41,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654397618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:41,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:41,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-01 15:00:41,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541412922] [2022-03-01 15:00:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:41,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-01 15:00:41,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:41,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-01 15:00:41,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-03-01 15:00:41,610 INFO L87 Difference]: Start difference. First operand 113321 states and 349329 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:50,625 INFO L93 Difference]: Finished difference Result 168926 states and 520215 transitions. [2022-03-01 15:00:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-01 15:00:50,626 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:00:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:51,217 INFO L225 Difference]: With dead ends: 168926 [2022-03-01 15:00:51,217 INFO L226 Difference]: Without dead ends: 168926 [2022-03-01 15:00:51,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1763, Invalid=4089, Unknown=0, NotChecked=0, Total=5852 [2022-03-01 15:00:51,219 INFO L933 BasicCegarLoop]: 1242 mSDtfsCounter, 2631 mSDsluCounter, 9736 mSDsCounter, 0 mSdLazyCounter, 3738 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2631 SdHoareTripleChecker+Valid, 10978 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:51,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2631 Valid, 10978 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3738 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:00:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168926 states. [2022-03-01 15:00:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168926 to 121350. [2022-03-01 15:00:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121350 states, 121346 states have (on average 3.0848565259670693) internal successors, (374335), 121349 states have internal predecessors, (374335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121350 states to 121350 states and 374335 transitions. [2022-03-01 15:00:54,811 INFO L78 Accepts]: Start accepts. Automaton has 121350 states and 374335 transitions. Word has length 105 [2022-03-01 15:00:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:54,812 INFO L470 AbstractCegarLoop]: Abstraction has 121350 states and 374335 transitions. [2022-03-01 15:00:54,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:00:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 121350 states and 374335 transitions. [2022-03-01 15:00:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:00:55,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:55,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:55,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 15:00:55,348 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -357336867, now seen corresponding path program 4 times [2022-03-01 15:00:55,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:55,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488112357] [2022-03-01 15:00:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:00:55,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:55,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488112357] [2022-03-01 15:00:55,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488112357] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:55,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:55,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-01 15:00:55,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891491562] [2022-03-01 15:00:55,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:55,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-01 15:00:55,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:55,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-01 15:00:55,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-03-01 15:00:55,951 INFO L87 Difference]: Start difference. First operand 121350 states and 374335 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:01,256 INFO L93 Difference]: Finished difference Result 179210 states and 552570 transitions. [2022-03-01 15:01:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 15:01:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:01:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:01,805 INFO L225 Difference]: With dead ends: 179210 [2022-03-01 15:01:01,805 INFO L226 Difference]: Without dead ends: 179210 [2022-03-01 15:01:01,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-03-01 15:01:01,806 INFO L933 BasicCegarLoop]: 773 mSDtfsCounter, 2332 mSDsluCounter, 8012 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 8785 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:01,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2332 Valid, 8785 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 15:01:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179210 states. [2022-03-01 15:01:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179210 to 129999. [2022-03-01 15:01:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129999 states, 129995 states have (on average 3.0886572560483097) internal successors, (401510), 129998 states have internal predecessors, (401510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129999 states to 129999 states and 401510 transitions. [2022-03-01 15:01:05,849 INFO L78 Accepts]: Start accepts. Automaton has 129999 states and 401510 transitions. Word has length 105 [2022-03-01 15:01:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:05,850 INFO L470 AbstractCegarLoop]: Abstraction has 129999 states and 401510 transitions. [2022-03-01 15:01:05,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 129999 states and 401510 transitions. [2022-03-01 15:01:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:01:05,987 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:05,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:05,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 15:01:05,987 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -635656309, now seen corresponding path program 5 times [2022-03-01 15:01:05,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:05,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639369090] [2022-03-01 15:01:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:01:06,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:06,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639369090] [2022-03-01 15:01:06,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639369090] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:06,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:06,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:01:06,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780610334] [2022-03-01 15:01:06,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:06,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:01:06,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:06,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:01:06,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:01:06,848 INFO L87 Difference]: Start difference. First operand 129999 states and 401510 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:18,814 INFO L93 Difference]: Finished difference Result 181315 states and 558830 transitions. [2022-03-01 15:01:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 15:01:18,815 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:01:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:19,321 INFO L225 Difference]: With dead ends: 181315 [2022-03-01 15:01:19,321 INFO L226 Difference]: Without dead ends: 181315 [2022-03-01 15:01:19,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:01:19,324 INFO L933 BasicCegarLoop]: 1497 mSDtfsCounter, 2833 mSDsluCounter, 12722 mSDsCounter, 0 mSdLazyCounter, 4859 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 14219 SdHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:19,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2833 Valid, 14219 Invalid, 4952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4859 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:01:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181315 states. [2022-03-01 15:01:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181315 to 133605. [2022-03-01 15:01:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133605 states, 133601 states have (on average 3.088270297378014) internal successors, (412596), 133604 states have internal predecessors, (412596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133605 states to 133605 states and 412596 transitions. [2022-03-01 15:01:23,397 INFO L78 Accepts]: Start accepts. Automaton has 133605 states and 412596 transitions. Word has length 105 [2022-03-01 15:01:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:23,397 INFO L470 AbstractCegarLoop]: Abstraction has 133605 states and 412596 transitions. [2022-03-01 15:01:23,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 133605 states and 412596 transitions. [2022-03-01 15:01:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:01:23,536 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:23,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:23,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 15:01:23,536 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash -694658595, now seen corresponding path program 6 times [2022-03-01 15:01:23,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:23,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747558748] [2022-03-01 15:01:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:24,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-03-01 15:01:24,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:24,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747558748] [2022-03-01 15:01:24,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747558748] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:24,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:24,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:01:24,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392521585] [2022-03-01 15:01:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:24,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:01:24,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:01:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:01:24,271 INFO L87 Difference]: Start difference. First operand 133605 states and 412596 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:36,990 INFO L93 Difference]: Finished difference Result 181605 states and 560461 transitions. [2022-03-01 15:01:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-01 15:01:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:01:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:37,778 INFO L225 Difference]: With dead ends: 181605 [2022-03-01 15:01:37,778 INFO L226 Difference]: Without dead ends: 181605 [2022-03-01 15:01:37,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2748, Invalid=6564, Unknown=0, NotChecked=0, Total=9312 [2022-03-01 15:01:37,781 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3039 mSDsluCounter, 12797 mSDsCounter, 0 mSdLazyCounter, 5351 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 14331 SdHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 5351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:37,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3039 Valid, 14331 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 5351 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-01 15:01:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181605 states. [2022-03-01 15:01:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181605 to 147726. [2022-03-01 15:01:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147726 states, 147722 states have (on average 3.090067830113321) internal successors, (456471), 147725 states have internal predecessors, (456471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147726 states to 147726 states and 456471 transitions. [2022-03-01 15:01:42,269 INFO L78 Accepts]: Start accepts. Automaton has 147726 states and 456471 transitions. Word has length 105 [2022-03-01 15:01:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:42,279 INFO L470 AbstractCegarLoop]: Abstraction has 147726 states and 456471 transitions. [2022-03-01 15:01:42,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 147726 states and 456471 transitions. [2022-03-01 15:01:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:01:42,437 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:42,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:42,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 15:01:42,438 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089269, now seen corresponding path program 7 times [2022-03-01 15:01:42,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:42,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881582027] [2022-03-01 15:01:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:01:43,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:43,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881582027] [2022-03-01 15:01:43,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881582027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:43,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:43,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:01:43,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163544764] [2022-03-01 15:01:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:43,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:01:43,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:01:43,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:01:43,242 INFO L87 Difference]: Start difference. First operand 147726 states and 456471 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:50,618 INFO L93 Difference]: Finished difference Result 245075 states and 758642 transitions. [2022-03-01 15:01:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-01 15:01:50,618 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:01:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:51,765 INFO L225 Difference]: With dead ends: 245075 [2022-03-01 15:01:51,766 INFO L226 Difference]: Without dead ends: 245075 [2022-03-01 15:01:51,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1098, Invalid=2934, Unknown=0, NotChecked=0, Total=4032 [2022-03-01 15:01:51,767 INFO L933 BasicCegarLoop]: 799 mSDtfsCounter, 2866 mSDsluCounter, 9631 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2866 SdHoareTripleChecker+Valid, 10430 SdHoareTripleChecker+Invalid, 4171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:51,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2866 Valid, 10430 Invalid, 4171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:01:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245075 states. [2022-03-01 15:01:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245075 to 163133. [2022-03-01 15:01:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163133 states, 163129 states have (on average 3.095041347645115) internal successors, (504891), 163132 states have internal predecessors, (504891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163133 states to 163133 states and 504891 transitions. [2022-03-01 15:01:56,930 INFO L78 Accepts]: Start accepts. Automaton has 163133 states and 504891 transitions. Word has length 105 [2022-03-01 15:01:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:56,930 INFO L470 AbstractCegarLoop]: Abstraction has 163133 states and 504891 transitions. [2022-03-01 15:01:56,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:01:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 163133 states and 504891 transitions. [2022-03-01 15:01:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:01:57,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:57,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:57,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 15:01:57,146 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 496431157, now seen corresponding path program 8 times [2022-03-01 15:01:57,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:57,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864012626] [2022-03-01 15:01:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:01:57,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:57,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864012626] [2022-03-01 15:01:57,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864012626] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:57,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:57,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:01:57,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706914070] [2022-03-01 15:01:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:57,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:01:57,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:57,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:01:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:01:57,765 INFO L87 Difference]: Start difference. First operand 163133 states and 504891 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:05,728 INFO L93 Difference]: Finished difference Result 244447 states and 755883 transitions. [2022-03-01 15:02:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-01 15:02:05,728 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:02:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:06,855 INFO L225 Difference]: With dead ends: 244447 [2022-03-01 15:02:06,855 INFO L226 Difference]: Without dead ends: 244447 [2022-03-01 15:02:06,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-01 15:02:06,856 INFO L933 BasicCegarLoop]: 941 mSDtfsCounter, 3199 mSDsluCounter, 10610 mSDsCounter, 0 mSdLazyCounter, 4442 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3199 SdHoareTripleChecker+Valid, 11551 SdHoareTripleChecker+Invalid, 4530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:06,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3199 Valid, 11551 Invalid, 4530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4442 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:02:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244447 states. [2022-03-01 15:02:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244447 to 165179. [2022-03-01 15:02:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165179 states, 165175 states have (on average 3.0942636597548057) internal successors, (511095), 165178 states have internal predecessors, (511095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165179 states to 165179 states and 511095 transitions. [2022-03-01 15:02:11,919 INFO L78 Accepts]: Start accepts. Automaton has 165179 states and 511095 transitions. Word has length 105 [2022-03-01 15:02:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:02:11,919 INFO L470 AbstractCegarLoop]: Abstraction has 165179 states and 511095 transitions. [2022-03-01 15:02:11,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 165179 states and 511095 transitions. [2022-03-01 15:02:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:02:12,130 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:02:12,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:02:12,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 15:02:12,130 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:02:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:02:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1624408711, now seen corresponding path program 9 times [2022-03-01 15:02:12,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:02:12,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608826762] [2022-03-01 15:02:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:02:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:02:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:02:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:02:13,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:02:13,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608826762] [2022-03-01 15:02:13,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608826762] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:02:13,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:02:13,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:02:13,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642794495] [2022-03-01 15:02:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:02:13,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:02:13,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:02:13,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:02:13,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:02:13,184 INFO L87 Difference]: Start difference. First operand 165179 states and 511095 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:22,335 INFO L93 Difference]: Finished difference Result 237707 states and 734606 transitions. [2022-03-01 15:02:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 15:02:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:02:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:23,462 INFO L225 Difference]: With dead ends: 237707 [2022-03-01 15:02:23,463 INFO L226 Difference]: Without dead ends: 237707 [2022-03-01 15:02:23,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1481, Invalid=3631, Unknown=0, NotChecked=0, Total=5112 [2022-03-01 15:02:23,465 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 2406 mSDsluCounter, 11858 mSDsCounter, 0 mSdLazyCounter, 5056 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 12969 SdHoareTripleChecker+Invalid, 5138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 5056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:23,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2406 Valid, 12969 Invalid, 5138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 5056 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-01 15:02:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237707 states. [2022-03-01 15:02:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237707 to 166884. [2022-03-01 15:02:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166884 states, 166880 states have (on average 3.0943732023010546) internal successors, (516389), 166883 states have internal predecessors, (516389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166884 states to 166884 states and 516389 transitions. [2022-03-01 15:02:29,007 INFO L78 Accepts]: Start accepts. Automaton has 166884 states and 516389 transitions. Word has length 105 [2022-03-01 15:02:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:02:29,007 INFO L470 AbstractCegarLoop]: Abstraction has 166884 states and 516389 transitions. [2022-03-01 15:02:29,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 166884 states and 516389 transitions. [2022-03-01 15:02:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:02:29,227 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:02:29,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:02:29,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 15:02:29,227 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:02:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:02:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1683410997, now seen corresponding path program 10 times [2022-03-01 15:02:29,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:02:29,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153546782] [2022-03-01 15:02:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:02:29,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:02:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:02:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:02:29,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:02:29,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153546782] [2022-03-01 15:02:29,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153546782] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:02:29,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:02:29,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:02:29,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92976055] [2022-03-01 15:02:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:02:29,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:02:29,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:02:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:02:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:02:29,867 INFO L87 Difference]: Start difference. First operand 166884 states and 516389 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:42,806 INFO L93 Difference]: Finished difference Result 212764 states and 657439 transitions. [2022-03-01 15:02:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-01 15:02:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:02:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:43,724 INFO L225 Difference]: With dead ends: 212764 [2022-03-01 15:02:43,724 INFO L226 Difference]: Without dead ends: 212764 [2022-03-01 15:02:43,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2909, Invalid=6991, Unknown=0, NotChecked=0, Total=9900 [2022-03-01 15:02:43,725 INFO L933 BasicCegarLoop]: 1640 mSDtfsCounter, 3149 mSDsluCounter, 13318 mSDsCounter, 0 mSdLazyCounter, 5515 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3149 SdHoareTripleChecker+Valid, 14958 SdHoareTripleChecker+Invalid, 5616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 5515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:43,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3149 Valid, 14958 Invalid, 5616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 5515 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-01 15:02:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212764 states. [2022-03-01 15:02:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212764 to 149247. [2022-03-01 15:02:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149247 states, 149243 states have (on average 3.0930093873749525) internal successors, (461610), 149246 states have internal predecessors, (461610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149247 states to 149247 states and 461610 transitions. [2022-03-01 15:02:48,015 INFO L78 Accepts]: Start accepts. Automaton has 149247 states and 461610 transitions. Word has length 105 [2022-03-01 15:02:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:02:48,015 INFO L470 AbstractCegarLoop]: Abstraction has 149247 states and 461610 transitions. [2022-03-01 15:02:48,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 149247 states and 461610 transitions. [2022-03-01 15:02:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:02:48,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:02:48,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:02:48,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 15:02:48,184 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:02:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:02:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1090206221, now seen corresponding path program 11 times [2022-03-01 15:02:48,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:02:48,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529028226] [2022-03-01 15:02:48,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:02:48,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:02:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:02:49,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-03-01 15:02:49,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:02:49,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529028226] [2022-03-01 15:02:49,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529028226] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:02:49,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:02:49,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-01 15:02:49,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747674272] [2022-03-01 15:02:49,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:02:49,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-01 15:02:49,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:02:49,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-01 15:02:49,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-03-01 15:02:49,045 INFO L87 Difference]: Start difference. First operand 149247 states and 461610 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:54,026 INFO L93 Difference]: Finished difference Result 200958 states and 621007 transitions. [2022-03-01 15:02:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 15:02:54,026 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:02:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:54,887 INFO L225 Difference]: With dead ends: 200958 [2022-03-01 15:02:54,888 INFO L226 Difference]: Without dead ends: 200958 [2022-03-01 15:02:54,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-03-01 15:02:54,888 INFO L933 BasicCegarLoop]: 780 mSDtfsCounter, 2779 mSDsluCounter, 7392 mSDsCounter, 0 mSdLazyCounter, 3137 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 8172 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:54,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2779 Valid, 8172 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3137 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 15:02:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200958 states. [2022-03-01 15:02:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200958 to 149433. [2022-03-01 15:02:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149433 states, 149429 states have (on average 3.093556137028288) internal successors, (462267), 149432 states have internal predecessors, (462267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149433 states to 149433 states and 462267 transitions. [2022-03-01 15:02:59,144 INFO L78 Accepts]: Start accepts. Automaton has 149433 states and 462267 transitions. Word has length 105 [2022-03-01 15:02:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:02:59,144 INFO L470 AbstractCegarLoop]: Abstraction has 149433 states and 462267 transitions. [2022-03-01 15:02:59,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:02:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 149433 states and 462267 transitions. [2022-03-01 15:02:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:02:59,315 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:02:59,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:02:59,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 15:02:59,316 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:02:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:02:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash 811886779, now seen corresponding path program 12 times [2022-03-01 15:02:59,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:02:59,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158517853] [2022-03-01 15:02:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:02:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:02:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:03:00,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:00,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158517853] [2022-03-01 15:03:00,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158517853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:00,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:00,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:03:00,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686476370] [2022-03-01 15:03:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:00,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:03:00,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:03:00,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:03:00,355 INFO L87 Difference]: Start difference. First operand 149433 states and 462267 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:03:07,677 INFO L93 Difference]: Finished difference Result 190870 states and 589795 transitions. [2022-03-01 15:03:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-01 15:03:07,678 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:03:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:03:08,634 INFO L225 Difference]: With dead ends: 190870 [2022-03-01 15:03:08,634 INFO L226 Difference]: Without dead ends: 190870 [2022-03-01 15:03:08,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-03-01 15:03:08,635 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 2685 mSDsluCounter, 8646 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 9632 SdHoareTripleChecker+Invalid, 3766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:03:08,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2685 Valid, 9632 Invalid, 3766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-01 15:03:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190870 states. [2022-03-01 15:03:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190870 to 151262. [2022-03-01 15:03:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151262 states, 151258 states have (on average 3.093839664678893) internal successors, (467968), 151261 states have internal predecessors, (467968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151262 states to 151262 states and 467968 transitions. [2022-03-01 15:03:13,283 INFO L78 Accepts]: Start accepts. Automaton has 151262 states and 467968 transitions. Word has length 105 [2022-03-01 15:03:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:03:13,283 INFO L470 AbstractCegarLoop]: Abstraction has 151262 states and 467968 transitions. [2022-03-01 15:03:13,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 151262 states and 467968 transitions. [2022-03-01 15:03:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:03:13,445 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:03:13,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:03:13,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 15:03:13,445 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:03:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:03:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 752884493, now seen corresponding path program 13 times [2022-03-01 15:03:13,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:03:13,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428573155] [2022-03-01 15:03:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:03:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:03:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:03:14,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:14,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428573155] [2022-03-01 15:03:14,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428573155] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:14,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:14,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:03:14,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838780636] [2022-03-01 15:03:14,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:14,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:03:14,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:03:14,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:03:14,115 INFO L87 Difference]: Start difference. First operand 151262 states and 467968 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:03:27,348 INFO L93 Difference]: Finished difference Result 177136 states and 546989 transitions. [2022-03-01 15:03:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-01 15:03:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:03:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:03:28,106 INFO L225 Difference]: With dead ends: 177136 [2022-03-01 15:03:28,106 INFO L226 Difference]: Without dead ends: 177136 [2022-03-01 15:03:28,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2980, Invalid=7322, Unknown=0, NotChecked=0, Total=10302 [2022-03-01 15:03:28,107 INFO L933 BasicCegarLoop]: 1679 mSDtfsCounter, 3134 mSDsluCounter, 15721 mSDsCounter, 0 mSdLazyCounter, 6273 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3134 SdHoareTripleChecker+Valid, 17400 SdHoareTripleChecker+Invalid, 6370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 6273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:03:28,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3134 Valid, 17400 Invalid, 6370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 6273 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-01 15:03:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177136 states. [2022-03-01 15:03:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177136 to 128901. [2022-03-01 15:03:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128901 states, 128897 states have (on average 3.0884582263357565) internal successors, (398093), 128900 states have internal predecessors, (398093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128901 states to 128901 states and 398093 transitions. [2022-03-01 15:03:31,624 INFO L78 Accepts]: Start accepts. Automaton has 128901 states and 398093 transitions. Word has length 105 [2022-03-01 15:03:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:03:31,625 INFO L470 AbstractCegarLoop]: Abstraction has 128901 states and 398093 transitions. [2022-03-01 15:03:31,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 128901 states and 398093 transitions. [2022-03-01 15:03:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:03:31,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:03:31,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:03:31,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-01 15:03:31,754 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:03:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:03:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -379588419, now seen corresponding path program 14 times [2022-03-01 15:03:31,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:03:31,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733055473] [2022-03-01 15:03:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:03:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:03:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:03:32,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:32,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733055473] [2022-03-01 15:03:32,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733055473] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:32,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:32,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:03:32,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385811994] [2022-03-01 15:03:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:32,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:03:32,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:03:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:03:32,680 INFO L87 Difference]: Start difference. First operand 128901 states and 398093 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:03:45,775 INFO L93 Difference]: Finished difference Result 159157 states and 489956 transitions. [2022-03-01 15:03:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-01 15:03:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:03:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:03:46,223 INFO L225 Difference]: With dead ends: 159157 [2022-03-01 15:03:46,223 INFO L226 Difference]: Without dead ends: 159157 [2022-03-01 15:03:46,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3084, Invalid=7422, Unknown=0, NotChecked=0, Total=10506 [2022-03-01 15:03:46,224 INFO L933 BasicCegarLoop]: 1732 mSDtfsCounter, 3155 mSDsluCounter, 13248 mSDsCounter, 0 mSdLazyCounter, 5501 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3155 SdHoareTripleChecker+Valid, 14980 SdHoareTripleChecker+Invalid, 5600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 5501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:03:46,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3155 Valid, 14980 Invalid, 5600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 5501 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-01 15:03:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159157 states. [2022-03-01 15:03:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159157 to 133034. [2022-03-01 15:03:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133034 states, 133030 states have (on average 3.087025482973765) internal successors, (410667), 133033 states have internal predecessors, (410667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133034 states to 133034 states and 410667 transitions. [2022-03-01 15:03:49,651 INFO L78 Accepts]: Start accepts. Automaton has 133034 states and 410667 transitions. Word has length 105 [2022-03-01 15:03:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:03:49,651 INFO L470 AbstractCegarLoop]: Abstraction has 133034 states and 410667 transitions. [2022-03-01 15:03:49,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 133034 states and 410667 transitions. [2022-03-01 15:03:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:03:50,133 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:03:50,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:03:50,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-01 15:03:50,134 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:03:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:03:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1308959803, now seen corresponding path program 15 times [2022-03-01 15:03:50,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:03:50,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381648235] [2022-03-01 15:03:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:03:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:03:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:03:50,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:50,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381648235] [2022-03-01 15:03:50,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381648235] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:50,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:50,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:03:50,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95404345] [2022-03-01 15:03:50,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:50,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:03:50,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:03:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:03:50,754 INFO L87 Difference]: Start difference. First operand 133034 states and 410667 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:03:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:03:57,976 INFO L93 Difference]: Finished difference Result 180071 states and 554449 transitions. [2022-03-01 15:03:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:03:57,976 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:03:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:03:58,672 INFO L225 Difference]: With dead ends: 180071 [2022-03-01 15:03:58,672 INFO L226 Difference]: Without dead ends: 180071 [2022-03-01 15:03:58,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-01 15:03:58,673 INFO L933 BasicCegarLoop]: 1050 mSDtfsCounter, 3606 mSDsluCounter, 9302 mSDsCounter, 0 mSdLazyCounter, 3652 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3606 SdHoareTripleChecker+Valid, 10352 SdHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:03:58,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3606 Valid, 10352 Invalid, 3731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3652 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 15:03:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180071 states. [2022-03-01 15:04:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180071 to 134522. [2022-03-01 15:04:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134522 states, 134518 states have (on average 3.0868285285240638) internal successors, (415234), 134521 states have internal predecessors, (415234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134522 states to 134522 states and 415234 transitions. [2022-03-01 15:04:02,701 INFO L78 Accepts]: Start accepts. Automaton has 134522 states and 415234 transitions. Word has length 105 [2022-03-01 15:04:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:02,701 INFO L470 AbstractCegarLoop]: Abstraction has 134522 states and 415234 transitions. [2022-03-01 15:04:02,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 134522 states and 415234 transitions. [2022-03-01 15:04:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:04:02,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:02,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:04:02,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-01 15:04:02,873 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1677400173, now seen corresponding path program 16 times [2022-03-01 15:04:02,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:02,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245012823] [2022-03-01 15:04:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:04:03,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:03,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245012823] [2022-03-01 15:04:03,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245012823] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:03,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:03,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:04:03,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250982166] [2022-03-01 15:04:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:03,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:04:03,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:03,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:04:03,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:04:03,730 INFO L87 Difference]: Start difference. First operand 134522 states and 415234 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:14,502 INFO L93 Difference]: Finished difference Result 187373 states and 576994 transitions. [2022-03-01 15:04:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 15:04:14,502 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:04:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:15,215 INFO L225 Difference]: With dead ends: 187373 [2022-03-01 15:04:15,215 INFO L226 Difference]: Without dead ends: 187373 [2022-03-01 15:04:15,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:04:15,216 INFO L933 BasicCegarLoop]: 1335 mSDtfsCounter, 3074 mSDsluCounter, 14417 mSDsCounter, 0 mSdLazyCounter, 5760 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3074 SdHoareTripleChecker+Valid, 15752 SdHoareTripleChecker+Invalid, 5834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 5760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:15,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3074 Valid, 15752 Invalid, 5834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 5760 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-01 15:04:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187373 states. [2022-03-01 15:04:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187373 to 135018. [2022-03-01 15:04:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135018 states, 135014 states have (on average 3.0870354185491875) internal successors, (416793), 135017 states have internal predecessors, (416793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135018 states to 135018 states and 416793 transitions. [2022-03-01 15:04:18,808 INFO L78 Accepts]: Start accepts. Automaton has 135018 states and 416793 transitions. Word has length 105 [2022-03-01 15:04:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:18,809 INFO L470 AbstractCegarLoop]: Abstraction has 135018 states and 416793 transitions. [2022-03-01 15:04:18,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 135018 states and 416793 transitions. [2022-03-01 15:04:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:04:19,299 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:19,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:04:19,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-01 15:04:19,299 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1399080731, now seen corresponding path program 17 times [2022-03-01 15:04:19,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:19,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754470177] [2022-03-01 15:04:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:04:19,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:19,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754470177] [2022-03-01 15:04:19,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754470177] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:19,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:19,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:04:19,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704540459] [2022-03-01 15:04:19,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:19,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:04:19,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:19,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:04:19,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:04:19,967 INFO L87 Difference]: Start difference. First operand 135018 states and 416793 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:30,045 INFO L93 Difference]: Finished difference Result 186495 states and 574243 transitions. [2022-03-01 15:04:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-01 15:04:30,046 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:04:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:30,572 INFO L225 Difference]: With dead ends: 186495 [2022-03-01 15:04:30,572 INFO L226 Difference]: Without dead ends: 186495 [2022-03-01 15:04:30,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-03-01 15:04:30,573 INFO L933 BasicCegarLoop]: 1374 mSDtfsCounter, 2518 mSDsluCounter, 10449 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 11823 SdHoareTripleChecker+Invalid, 4146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:30,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2518 Valid, 11823 Invalid, 4146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:04:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186495 states. [2022-03-01 15:04:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186495 to 143326. [2022-03-01 15:04:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143326 states, 143322 states have (on average 3.0884651344524916) internal successors, (442645), 143325 states have internal predecessors, (442645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143326 states to 143326 states and 442645 transitions. [2022-03-01 15:04:34,689 INFO L78 Accepts]: Start accepts. Automaton has 143326 states and 442645 transitions. Word has length 105 [2022-03-01 15:04:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:34,689 INFO L470 AbstractCegarLoop]: Abstraction has 143326 states and 442645 transitions. [2022-03-01 15:04:34,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 143326 states and 442645 transitions. [2022-03-01 15:04:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:04:34,841 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:34,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:04:34,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-01 15:04:34,842 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1855323451, now seen corresponding path program 18 times [2022-03-01 15:04:34,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:34,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68528809] [2022-03-01 15:04:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:04:35,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:35,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68528809] [2022-03-01 15:04:35,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68528809] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:35,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:35,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:04:35,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645818926] [2022-03-01 15:04:35,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:35,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:04:35,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:04:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:04:35,414 INFO L87 Difference]: Start difference. First operand 143326 states and 442645 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:42,805 INFO L93 Difference]: Finished difference Result 199052 states and 613803 transitions. [2022-03-01 15:04:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 15:04:42,806 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:04:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:43,665 INFO L225 Difference]: With dead ends: 199052 [2022-03-01 15:04:43,666 INFO L226 Difference]: Without dead ends: 199052 [2022-03-01 15:04:43,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-03-01 15:04:43,667 INFO L933 BasicCegarLoop]: 816 mSDtfsCounter, 3476 mSDsluCounter, 9431 mSDsCounter, 0 mSdLazyCounter, 3793 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3476 SdHoareTripleChecker+Valid, 10247 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:43,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3476 Valid, 10247 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3793 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:04:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199052 states. [2022-03-01 15:04:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199052 to 150332. [2022-03-01 15:04:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150332 states, 150328 states have (on average 3.0917460486403066) internal successors, (464776), 150331 states have internal predecessors, (464776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150332 states to 150332 states and 464776 transitions. [2022-03-01 15:04:47,875 INFO L78 Accepts]: Start accepts. Automaton has 150332 states and 464776 transitions. Word has length 105 [2022-03-01 15:04:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:47,875 INFO L470 AbstractCegarLoop]: Abstraction has 150332 states and 464776 transitions. [2022-03-01 15:04:47,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 150332 states and 464776 transitions. [2022-03-01 15:04:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:04:48,283 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:48,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] [2022-03-01 15:04:48,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-01 15:04:48,284 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash -597123419, now seen corresponding path program 19 times [2022-03-01 15:04:48,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:48,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554372027] [2022-03-01 15:04:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:48,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:04:49,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:49,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554372027] [2022-03-01 15:04:49,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554372027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:49,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:49,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:04:49,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756628147] [2022-03-01 15:04:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:49,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:04:49,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:04:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:04:49,130 INFO L87 Difference]: Start difference. First operand 150332 states and 464776 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:04:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:56,210 INFO L93 Difference]: Finished difference Result 199269 states and 614244 transitions. [2022-03-01 15:04:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-01 15:04:56,210 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:04:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:57,075 INFO L225 Difference]: With dead ends: 199269 [2022-03-01 15:04:57,075 INFO L226 Difference]: Without dead ends: 199269 [2022-03-01 15:04:57,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-01 15:04:57,075 INFO L933 BasicCegarLoop]: 958 mSDtfsCounter, 3083 mSDsluCounter, 9230 mSDsCounter, 0 mSdLazyCounter, 3757 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3083 SdHoareTripleChecker+Valid, 10188 SdHoareTripleChecker+Invalid, 3835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:57,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3083 Valid, 10188 Invalid, 3835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3757 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:04:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199269 states. [2022-03-01 15:05:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199269 to 151448. [2022-03-01 15:05:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151448 states, 151444 states have (on average 3.091307678085629) internal successors, (468160), 151447 states have internal predecessors, (468160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151448 states to 151448 states and 468160 transitions. [2022-03-01 15:05:01,378 INFO L78 Accepts]: Start accepts. Automaton has 151448 states and 468160 transitions. Word has length 105 [2022-03-01 15:05:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:01,379 INFO L470 AbstractCegarLoop]: Abstraction has 151448 states and 468160 transitions. [2022-03-01 15:05:01,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 151448 states and 468160 transitions. [2022-03-01 15:05:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:05:01,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:01,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:01,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-01 15:05:01,552 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:01,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1577004009, now seen corresponding path program 20 times [2022-03-01 15:05:01,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:01,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712993292] [2022-03-01 15:05:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:01,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:05:02,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:02,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712993292] [2022-03-01 15:05:02,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712993292] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:02,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:02,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:05:02,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969886272] [2022-03-01 15:05:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:02,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:05:02,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:05:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:05:02,649 INFO L87 Difference]: Start difference. First operand 151448 states and 468160 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:14,108 INFO L93 Difference]: Finished difference Result 198718 states and 612275 transitions. [2022-03-01 15:05:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 15:05:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:05:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:14,948 INFO L225 Difference]: With dead ends: 198718 [2022-03-01 15:05:14,948 INFO L226 Difference]: Without dead ends: 198718 [2022-03-01 15:05:14,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:05:14,949 INFO L933 BasicCegarLoop]: 1509 mSDtfsCounter, 3107 mSDsluCounter, 13220 mSDsCounter, 0 mSdLazyCounter, 5310 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3107 SdHoareTripleChecker+Valid, 14729 SdHoareTripleChecker+Invalid, 5408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 5310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:14,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3107 Valid, 14729 Invalid, 5408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 5310 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-01 15:05:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198718 states. [2022-03-01 15:05:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198718 to 144039. [2022-03-01 15:05:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144039 states, 144035 states have (on average 3.0900961571840178) internal successors, (445082), 144038 states have internal predecessors, (445082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144039 states to 144039 states and 445082 transitions. [2022-03-01 15:05:19,080 INFO L78 Accepts]: Start accepts. Automaton has 144039 states and 445082 transitions. Word has length 105 [2022-03-01 15:05:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:19,080 INFO L470 AbstractCegarLoop]: Abstraction has 144039 states and 445082 transitions. [2022-03-01 15:05:19,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 144039 states and 445082 transitions. [2022-03-01 15:05:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:05:19,232 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:19,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:19,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-01 15:05:19,233 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1518001723, now seen corresponding path program 21 times [2022-03-01 15:05:19,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:19,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647363893] [2022-03-01 15:05:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:05:19,856 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:19,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647363893] [2022-03-01 15:05:19,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647363893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:19,856 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:19,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:05:19,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406605778] [2022-03-01 15:05:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:19,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:05:19,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:05:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:05:19,857 INFO L87 Difference]: Start difference. First operand 144039 states and 445082 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:30,953 INFO L93 Difference]: Finished difference Result 190782 states and 587489 transitions. [2022-03-01 15:05:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-01 15:05:30,954 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:05:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:31,529 INFO L225 Difference]: With dead ends: 190782 [2022-03-01 15:05:31,529 INFO L226 Difference]: Without dead ends: 190782 [2022-03-01 15:05:31,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2387, Invalid=5623, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:05:31,530 INFO L933 BasicCegarLoop]: 1538 mSDtfsCounter, 2853 mSDsluCounter, 11410 mSDsCounter, 0 mSdLazyCounter, 4424 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2853 SdHoareTripleChecker+Valid, 12948 SdHoareTripleChecker+Invalid, 4511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:31,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2853 Valid, 12948 Invalid, 4511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4424 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-01 15:05:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190782 states. [2022-03-01 15:05:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190782 to 142551. [2022-03-01 15:05:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142551 states, 142547 states have (on average 3.0899282341964405) internal successors, (440460), 142550 states have internal predecessors, (440460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142551 states to 142551 states and 440460 transitions. [2022-03-01 15:05:35,665 INFO L78 Accepts]: Start accepts. Automaton has 142551 states and 440460 transitions. Word has length 105 [2022-03-01 15:05:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:35,665 INFO L470 AbstractCegarLoop]: Abstraction has 142551 states and 440460 transitions. [2022-03-01 15:05:35,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 142551 states and 440460 transitions. [2022-03-01 15:05:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:05:35,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:35,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:35,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-01 15:05:35,809 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash 866571049, now seen corresponding path program 22 times [2022-03-01 15:05:35,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:35,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724259094] [2022-03-01 15:05:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:05:36,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:36,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724259094] [2022-03-01 15:05:36,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724259094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:36,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:36,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:05:36,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104906435] [2022-03-01 15:05:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:36,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:05:36,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:36,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:05:36,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:05:36,438 INFO L87 Difference]: Start difference. First operand 142551 states and 440460 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:44,263 INFO L93 Difference]: Finished difference Result 233273 states and 720655 transitions. [2022-03-01 15:05:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 15:05:44,264 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:05:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:45,577 INFO L225 Difference]: With dead ends: 233273 [2022-03-01 15:05:45,577 INFO L226 Difference]: Without dead ends: 233273 [2022-03-01 15:05:45,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-03-01 15:05:45,578 INFO L933 BasicCegarLoop]: 820 mSDtfsCounter, 3181 mSDsluCounter, 10654 mSDsCounter, 0 mSdLazyCounter, 4667 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3181 SdHoareTripleChecker+Valid, 11474 SdHoareTripleChecker+Invalid, 4750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:45,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3181 Valid, 11474 Invalid, 4750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4667 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-01 15:05:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233273 states. [2022-03-01 15:05:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233273 to 153091. [2022-03-01 15:05:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153091 states, 153087 states have (on average 3.093633032197378) internal successors, (473595), 153090 states have internal predecessors, (473595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153091 states to 153091 states and 473595 transitions. [2022-03-01 15:05:50,323 INFO L78 Accepts]: Start accepts. Automaton has 153091 states and 473595 transitions. Word has length 105 [2022-03-01 15:05:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:50,323 INFO L470 AbstractCegarLoop]: Abstraction has 153091 states and 473595 transitions. [2022-03-01 15:05:50,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 153091 states and 473595 transitions. [2022-03-01 15:05:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:05:50,898 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:50,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:50,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-01 15:05:50,898 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1585875821, now seen corresponding path program 23 times [2022-03-01 15:05:50,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:50,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318094082] [2022-03-01 15:05:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:05:51,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:51,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318094082] [2022-03-01 15:05:51,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318094082] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:51,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:51,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:05:51,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989677670] [2022-03-01 15:05:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:51,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:05:51,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:51,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:05:51,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:05:51,493 INFO L87 Difference]: Start difference. First operand 153091 states and 473595 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:05:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:59,004 INFO L93 Difference]: Finished difference Result 232808 states and 718687 transitions. [2022-03-01 15:05:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-01 15:05:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:05:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:59,732 INFO L225 Difference]: With dead ends: 232808 [2022-03-01 15:05:59,732 INFO L226 Difference]: Without dead ends: 232808 [2022-03-01 15:05:59,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-01 15:05:59,733 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 2839 mSDsluCounter, 9942 mSDsCounter, 0 mSdLazyCounter, 4251 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 10895 SdHoareTripleChecker+Invalid, 4322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:59,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2839 Valid, 10895 Invalid, 4322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4251 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-01 15:06:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232808 states. [2022-03-01 15:06:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232808 to 154207. [2022-03-01 15:06:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154207 states, 154203 states have (on average 3.0931888484659833) internal successors, (476979), 154206 states have internal predecessors, (476979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154207 states to 154207 states and 476979 transitions. [2022-03-01 15:06:04,596 INFO L78 Accepts]: Start accepts. Automaton has 154207 states and 476979 transitions. Word has length 105 [2022-03-01 15:06:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:04,596 INFO L470 AbstractCegarLoop]: Abstraction has 154207 states and 476979 transitions. [2022-03-01 15:06:04,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 154207 states and 476979 transitions. [2022-03-01 15:06:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:06:04,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:04,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:04,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-01 15:06:04,801 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash 588251607, now seen corresponding path program 24 times [2022-03-01 15:06:04,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:04,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429264049] [2022-03-01 15:06:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:06:05,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:05,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429264049] [2022-03-01 15:06:05,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429264049] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:05,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:05,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:06:05,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415611562] [2022-03-01 15:06:05,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:05,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:06:05,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:05,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:06:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:06:05,508 INFO L87 Difference]: Start difference. First operand 154207 states and 476979 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:06:15,319 INFO L93 Difference]: Finished difference Result 227349 states and 701584 transitions. [2022-03-01 15:06:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 15:06:15,319 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:06:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:06:16,348 INFO L225 Difference]: With dead ends: 227349 [2022-03-01 15:06:16,348 INFO L226 Difference]: Without dead ends: 227349 [2022-03-01 15:06:16,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1480, Invalid=3632, Unknown=0, NotChecked=0, Total=5112 [2022-03-01 15:06:16,349 INFO L933 BasicCegarLoop]: 1123 mSDtfsCounter, 2470 mSDsluCounter, 10956 mSDsCounter, 0 mSdLazyCounter, 4795 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2470 SdHoareTripleChecker+Valid, 12079 SdHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 4795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:06:16,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2470 Valid, 12079 Invalid, 4874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 4795 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:06:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227349 states. [2022-03-01 15:06:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227349 to 155230. [2022-03-01 15:06:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155230 states, 155226 states have (on average 3.0931867084122504) internal successors, (480143), 155229 states have internal predecessors, (480143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155230 states to 155230 states and 480143 transitions. [2022-03-01 15:06:21,197 INFO L78 Accepts]: Start accepts. Automaton has 155230 states and 480143 transitions. Word has length 105 [2022-03-01 15:06:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:21,198 INFO L470 AbstractCegarLoop]: Abstraction has 155230 states and 480143 transitions. [2022-03-01 15:06:21,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 155230 states and 480143 transitions. [2022-03-01 15:06:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:06:21,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:21,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:21,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-01 15:06:21,430 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash 529249321, now seen corresponding path program 25 times [2022-03-01 15:06:21,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:21,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481538297] [2022-03-01 15:06:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:06:22,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:22,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481538297] [2022-03-01 15:06:22,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481538297] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:22,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:22,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:06:22,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519519261] [2022-03-01 15:06:22,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:22,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:06:22,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:22,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:06:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:06:22,466 INFO L87 Difference]: Start difference. First operand 155230 states and 480143 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:06:34,771 INFO L93 Difference]: Finished difference Result 221250 states and 682464 transitions. [2022-03-01 15:06:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-01 15:06:34,771 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:06:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:06:35,762 INFO L225 Difference]: With dead ends: 221250 [2022-03-01 15:06:35,762 INFO L226 Difference]: Without dead ends: 221250 [2022-03-01 15:06:35,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2549, Invalid=6007, Unknown=0, NotChecked=0, Total=8556 [2022-03-01 15:06:35,763 INFO L933 BasicCegarLoop]: 1628 mSDtfsCounter, 2867 mSDsluCounter, 11882 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 13510 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:06:35,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2867 Valid, 13510 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:06:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221250 states. [2022-03-01 15:06:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221250 to 153246. [2022-03-01 15:06:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153246 states, 153242 states have (on average 3.0936362093942913) internal successors, (474075), 153245 states have internal predecessors, (474075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153246 states to 153246 states and 474075 transitions. [2022-03-01 15:06:40,662 INFO L78 Accepts]: Start accepts. Automaton has 153246 states and 474075 transitions. Word has length 105 [2022-03-01 15:06:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:40,662 INFO L470 AbstractCegarLoop]: Abstraction has 153246 states and 474075 transitions. [2022-03-01 15:06:40,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 153246 states and 474075 transitions. [2022-03-01 15:06:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:06:40,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:40,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:40,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-01 15:06:40,862 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash -992100757, now seen corresponding path program 26 times [2022-03-01 15:06:40,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:40,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083696259] [2022-03-01 15:06:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:06:41,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:41,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083696259] [2022-03-01 15:06:41,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083696259] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:41,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:41,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:06:41,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944820173] [2022-03-01 15:06:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:41,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:06:41,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:06:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:06:41,461 INFO L87 Difference]: Start difference. First operand 153246 states and 474075 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:06:49,556 INFO L93 Difference]: Finished difference Result 237654 states and 735727 transitions. [2022-03-01 15:06:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 15:06:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:06:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:06:50,686 INFO L225 Difference]: With dead ends: 237654 [2022-03-01 15:06:50,687 INFO L226 Difference]: Without dead ends: 237654 [2022-03-01 15:06:50,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-03-01 15:06:50,688 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 3519 mSDsluCounter, 9737 mSDsCounter, 0 mSdLazyCounter, 4349 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 10560 SdHoareTripleChecker+Invalid, 4437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:06:50,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3519 Valid, 10560 Invalid, 4437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4349 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:06:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237654 states. [2022-03-01 15:06:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237654 to 166204. [2022-03-01 15:06:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166204 states, 166200 states have (on average 3.1035860409145606) internal successors, (515816), 166203 states have internal predecessors, (515816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166204 states to 166204 states and 515816 transitions. [2022-03-01 15:06:55,952 INFO L78 Accepts]: Start accepts. Automaton has 166204 states and 515816 transitions. Word has length 105 [2022-03-01 15:06:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:55,952 INFO L470 AbstractCegarLoop]: Abstraction has 166204 states and 515816 transitions. [2022-03-01 15:06:55,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:06:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 166204 states and 515816 transitions. [2022-03-01 15:06:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:06:56,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:56,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:56,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-01 15:06:56,196 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:56,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 850419669, now seen corresponding path program 27 times [2022-03-01 15:06:56,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:56,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524141247] [2022-03-01 15:06:56,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:06:56,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:56,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524141247] [2022-03-01 15:06:56,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524141247] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:56,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:56,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:06:56,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568306214] [2022-03-01 15:06:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:56,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:06:56,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:06:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:06:56,776 INFO L87 Difference]: Start difference. First operand 166204 states and 515816 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:07:04,815 INFO L93 Difference]: Finished difference Result 227641 states and 703722 transitions. [2022-03-01 15:07:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-01 15:07:04,816 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:07:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:07:05,845 INFO L225 Difference]: With dead ends: 227641 [2022-03-01 15:07:05,845 INFO L226 Difference]: Without dead ends: 227641 [2022-03-01 15:07:05,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-01 15:07:05,845 INFO L933 BasicCegarLoop]: 956 mSDtfsCounter, 2950 mSDsluCounter, 10008 mSDsCounter, 0 mSdLazyCounter, 4489 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2950 SdHoareTripleChecker+Valid, 10964 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:07:05,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2950 Valid, 10964 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4489 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:07:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227641 states. [2022-03-01 15:07:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227641 to 156811. [2022-03-01 15:07:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156811 states, 156807 states have (on average 3.09520620890649) internal successors, (485350), 156810 states have internal predecessors, (485350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156811 states to 156811 states and 485350 transitions. [2022-03-01 15:07:10,680 INFO L78 Accepts]: Start accepts. Automaton has 156811 states and 485350 transitions. Word has length 105 [2022-03-01 15:07:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:07:10,680 INFO L470 AbstractCegarLoop]: Abstraction has 156811 states and 485350 transitions. [2022-03-01 15:07:10,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 156811 states and 485350 transitions. [2022-03-01 15:07:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:07:11,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:07:11,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:07:11,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-01 15:07:11,290 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:07:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:07:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1270420199, now seen corresponding path program 28 times [2022-03-01 15:07:11,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:07:11,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370790616] [2022-03-01 15:07:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:07:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:07:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:07:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:07:12,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:07:12,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370790616] [2022-03-01 15:07:12,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370790616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:07:12,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:07:12,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:07:12,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985730772] [2022-03-01 15:07:12,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:07:12,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:07:12,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:07:12,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:07:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:07:12,019 INFO L87 Difference]: Start difference. First operand 156811 states and 485350 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:07:19,872 INFO L93 Difference]: Finished difference Result 214794 states and 663183 transitions. [2022-03-01 15:07:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-01 15:07:19,872 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:07:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:07:20,566 INFO L225 Difference]: With dead ends: 214794 [2022-03-01 15:07:20,566 INFO L226 Difference]: Without dead ends: 214794 [2022-03-01 15:07:20,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-03-01 15:07:20,567 INFO L933 BasicCegarLoop]: 998 mSDtfsCounter, 2789 mSDsluCounter, 8425 mSDsCounter, 0 mSdLazyCounter, 3665 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 9423 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:07:20,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2789 Valid, 9423 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3665 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:07:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214794 states. [2022-03-01 15:07:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214794 to 158547. [2022-03-01 15:07:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158547 states, 158543 states have (on average 3.0954945976801245) internal successors, (490769), 158546 states have internal predecessors, (490769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158547 states to 158547 states and 490769 transitions. [2022-03-01 15:07:25,538 INFO L78 Accepts]: Start accepts. Automaton has 158547 states and 490769 transitions. Word has length 105 [2022-03-01 15:07:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:07:25,538 INFO L470 AbstractCegarLoop]: Abstraction has 158547 states and 490769 transitions. [2022-03-01 15:07:25,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 158547 states and 490769 transitions. [2022-03-01 15:07:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:07:25,742 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:07:25,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:07:25,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-01 15:07:25,742 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:07:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:07:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1329422485, now seen corresponding path program 29 times [2022-03-01 15:07:25,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:07:25,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22239874] [2022-03-01 15:07:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:07:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:07:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:07:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:07:26,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:07:26,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22239874] [2022-03-01 15:07:26,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22239874] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:07:26,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:07:26,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:07:26,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046251957] [2022-03-01 15:07:26,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:07:26,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:07:26,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:07:26,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:07:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:07:26,687 INFO L87 Difference]: Start difference. First operand 158547 states and 490769 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:07:39,227 INFO L93 Difference]: Finished difference Result 212229 states and 654614 transitions. [2022-03-01 15:07:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-01 15:07:39,227 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:07:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:07:40,177 INFO L225 Difference]: With dead ends: 212229 [2022-03-01 15:07:40,178 INFO L226 Difference]: Without dead ends: 212229 [2022-03-01 15:07:40,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2594, Invalid=6148, Unknown=0, NotChecked=0, Total=8742 [2022-03-01 15:07:40,178 INFO L933 BasicCegarLoop]: 1659 mSDtfsCounter, 2524 mSDsluCounter, 13609 mSDsCounter, 0 mSdLazyCounter, 5676 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2524 SdHoareTripleChecker+Valid, 15268 SdHoareTripleChecker+Invalid, 5752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 5676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:07:40,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2524 Valid, 15268 Invalid, 5752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 5676 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-01 15:07:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212229 states. [2022-03-01 15:07:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212229 to 153339. [2022-03-01 15:07:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153339 states, 153335 states have (on average 3.0942054977663287) internal successors, (474450), 153338 states have internal predecessors, (474450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153339 states to 153339 states and 474450 transitions. [2022-03-01 15:07:44,676 INFO L78 Accepts]: Start accepts. Automaton has 153339 states and 474450 transitions. Word has length 105 [2022-03-01 15:07:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:07:44,676 INFO L470 AbstractCegarLoop]: Abstraction has 153339 states and 474450 transitions. [2022-03-01 15:07:44,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:07:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 153339 states and 474450 transitions. [2022-03-01 15:07:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:07:45,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:07:45,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:07:45,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-01 15:07:45,271 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:07:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:07:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1833071899, now seen corresponding path program 30 times [2022-03-01 15:07:45,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:07:45,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723272719] [2022-03-01 15:07:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:07:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:07:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:07:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:07:45,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:07:45,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723272719] [2022-03-01 15:07:45,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723272719] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:07:45,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:07:45,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:07:45,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658796848] [2022-03-01 15:07:45,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:07:45,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:07:45,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:07:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:07:45,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:07:45,962 INFO L87 Difference]: Start difference. First operand 153339 states and 474450 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:08:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:08:02,961 INFO L93 Difference]: Finished difference Result 237913 states and 732847 transitions. [2022-03-01 15:08:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-01 15:08:02,961 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:08:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:08:03,773 INFO L225 Difference]: With dead ends: 237913 [2022-03-01 15:08:03,773 INFO L226 Difference]: Without dead ends: 237913 [2022-03-01 15:08:03,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3990, Invalid=10530, Unknown=0, NotChecked=0, Total=14520 [2022-03-01 15:08:03,775 INFO L933 BasicCegarLoop]: 1901 mSDtfsCounter, 3612 mSDsluCounter, 14754 mSDsCounter, 0 mSdLazyCounter, 6406 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3612 SdHoareTripleChecker+Valid, 16655 SdHoareTripleChecker+Invalid, 6500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 6406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:08:03,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3612 Valid, 16655 Invalid, 6500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 6406 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-01 15:08:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237913 states. [2022-03-01 15:08:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237913 to 140877. [2022-03-01 15:08:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140877 states, 140873 states have (on average 3.088661418440723) internal successors, (435109), 140876 states have internal predecessors, (435109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:08:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140877 states to 140877 states and 435109 transitions. [2022-03-01 15:08:08,255 INFO L78 Accepts]: Start accepts. Automaton has 140877 states and 435109 transitions. Word has length 105 [2022-03-01 15:08:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:08:08,255 INFO L470 AbstractCegarLoop]: Abstraction has 140877 states and 435109 transitions. [2022-03-01 15:08:08,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:08:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 140877 states and 435109 transitions. [2022-03-01 15:08:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:08:08,422 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:08:08,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:08:08,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-01 15:08:08,423 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:08:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:08:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1666350753, now seen corresponding path program 31 times [2022-03-01 15:08:08,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:08:08,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737307866] [2022-03-01 15:08:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:08:08,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:08:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:08:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:08:09,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:08:09,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737307866] [2022-03-01 15:08:09,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737307866] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:08:09,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:08:09,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:08:09,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563754128] [2022-03-01 15:08:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:08:09,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:08:09,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:08:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:08:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:08:09,414 INFO L87 Difference]: Start difference. First operand 140877 states and 435109 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:08:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:08:28,360 INFO L93 Difference]: Finished difference Result 246583 states and 761014 transitions. [2022-03-01 15:08:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-01 15:08:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:08:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:08:29,133 INFO L225 Difference]: With dead ends: 246583 [2022-03-01 15:08:29,133 INFO L226 Difference]: Without dead ends: 246583 [2022-03-01 15:08:29,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2665 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=4164, Invalid=10842, Unknown=0, NotChecked=0, Total=15006 [2022-03-01 15:08:29,134 INFO L933 BasicCegarLoop]: 2352 mSDtfsCounter, 3514 mSDsluCounter, 21274 mSDsCounter, 0 mSdLazyCounter, 9241 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3514 SdHoareTripleChecker+Valid, 23626 SdHoareTripleChecker+Invalid, 9341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 9241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:08:29,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3514 Valid, 23626 Invalid, 9341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 9241 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-01 15:08:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246583 states. [2022-03-01 15:08:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246583 to 153587. [2022-03-01 15:08:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153587 states, 153583 states have (on average 3.0938189773607756) internal successors, (475158), 153586 states have internal predecessors, (475158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:08:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153587 states to 153587 states and 475158 transitions. [2022-03-01 15:08:34,367 INFO L78 Accepts]: Start accepts. Automaton has 153587 states and 475158 transitions. Word has length 105 [2022-03-01 15:08:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:08:34,367 INFO L470 AbstractCegarLoop]: Abstraction has 153587 states and 475158 transitions. [2022-03-01 15:08:34,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:08:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 153587 states and 475158 transitions. [2022-03-01 15:08:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:08:34,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:08:34,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:08:34,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-01 15:08:34,591 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:08:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:08:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash -610967297, now seen corresponding path program 32 times [2022-03-01 15:08:34,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:08:34,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996227383] [2022-03-01 15:08:34,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:08:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:08:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:08:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:08:35,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:08:35,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996227383] [2022-03-01 15:08:35,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996227383] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:08:35,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:08:35,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:08:35,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874663730] [2022-03-01 15:08:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:08:35,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:08:35,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:08:35,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:08:35,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:08:35,197 INFO L87 Difference]: Start difference. First operand 153587 states and 475158 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:08:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:08:55,187 INFO L93 Difference]: Finished difference Result 253290 states and 783061 transitions. [2022-03-01 15:08:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-01 15:08:55,187 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:08:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:08:56,377 INFO L225 Difference]: With dead ends: 253290 [2022-03-01 15:08:56,378 INFO L226 Difference]: Without dead ends: 253290 [2022-03-01 15:08:56,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3717 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=4723, Invalid=13367, Unknown=0, NotChecked=0, Total=18090 [2022-03-01 15:08:56,379 INFO L933 BasicCegarLoop]: 2526 mSDtfsCounter, 3154 mSDsluCounter, 18480 mSDsCounter, 0 mSdLazyCounter, 8172 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 21006 SdHoareTripleChecker+Invalid, 8261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 8172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:08:56,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3154 Valid, 21006 Invalid, 8261 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 8172 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-01 15:08:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253290 states. [2022-03-01 15:09:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253290 to 153649. [2022-03-01 15:09:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153649 states, 153645 states have (on average 3.093794135832601) internal successors, (475346), 153648 states have internal predecessors, (475346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153649 states to 153649 states and 475346 transitions. [2022-03-01 15:09:01,720 INFO L78 Accepts]: Start accepts. Automaton has 153649 states and 475346 transitions. Word has length 105 [2022-03-01 15:09:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:09:01,720 INFO L470 AbstractCegarLoop]: Abstraction has 153649 states and 475346 transitions. [2022-03-01 15:09:01,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 153649 states and 475346 transitions. [2022-03-01 15:09:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:09:01,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:09:01,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:09:01,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-01 15:09:01,924 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:09:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:09:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1308604067, now seen corresponding path program 33 times [2022-03-01 15:09:01,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:09:01,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218452433] [2022-03-01 15:09:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:09:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:09:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:09:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:09:02,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:09:02,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218452433] [2022-03-01 15:09:02,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218452433] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:09:02,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:09:02,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:09:02,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532184344] [2022-03-01 15:09:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:09:02,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:09:02,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:09:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:09:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:09:02,558 INFO L87 Difference]: Start difference. First operand 153649 states and 475346 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:09:22,670 INFO L93 Difference]: Finished difference Result 246346 states and 762005 transitions. [2022-03-01 15:09:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-01 15:09:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:09:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:09:23,809 INFO L225 Difference]: With dead ends: 246346 [2022-03-01 15:09:23,809 INFO L226 Difference]: Without dead ends: 246346 [2022-03-01 15:09:23,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4180 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=4985, Invalid=14475, Unknown=0, NotChecked=0, Total=19460 [2022-03-01 15:09:23,810 INFO L933 BasicCegarLoop]: 2647 mSDtfsCounter, 3786 mSDsluCounter, 19984 mSDsCounter, 0 mSdLazyCounter, 8907 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3786 SdHoareTripleChecker+Valid, 22631 SdHoareTripleChecker+Invalid, 9015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 8907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:09:23,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3786 Valid, 22631 Invalid, 9015 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 8907 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-01 15:09:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246346 states. [2022-03-01 15:09:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246346 to 153928. [2022-03-01 15:09:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153928 states, 153924 states have (on average 3.0938839946986825) internal successors, (476223), 153927 states have internal predecessors, (476223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153928 states to 153928 states and 476223 transitions. [2022-03-01 15:09:28,687 INFO L78 Accepts]: Start accepts. Automaton has 153928 states and 476223 transitions. Word has length 105 [2022-03-01 15:09:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:09:28,687 INFO L470 AbstractCegarLoop]: Abstraction has 153928 states and 476223 transitions. [2022-03-01 15:09:28,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 153928 states and 476223 transitions. [2022-03-01 15:09:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:09:29,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:09:29,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:09:29,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-01 15:09:29,300 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:09:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:09:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -371924933, now seen corresponding path program 34 times [2022-03-01 15:09:29,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:09:29,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381071558] [2022-03-01 15:09:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:09:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:09:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:09:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:09:29,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:09:29,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381071558] [2022-03-01 15:09:29,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381071558] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:09:29,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:09:29,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:09:29,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485774371] [2022-03-01 15:09:29,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:09:29,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:09:29,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:09:29,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:09:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:09:29,865 INFO L87 Difference]: Start difference. First operand 153928 states and 476223 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:09:49,549 INFO L93 Difference]: Finished difference Result 236157 states and 729167 transitions. [2022-03-01 15:09:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-03-01 15:09:49,549 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:09:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:09:50,352 INFO L225 Difference]: With dead ends: 236157 [2022-03-01 15:09:50,352 INFO L226 Difference]: Without dead ends: 236157 [2022-03-01 15:09:50,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4584 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=4945, Invalid=15077, Unknown=0, NotChecked=0, Total=20022 [2022-03-01 15:09:50,354 INFO L933 BasicCegarLoop]: 2644 mSDtfsCounter, 3211 mSDsluCounter, 21541 mSDsCounter, 0 mSdLazyCounter, 9320 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3211 SdHoareTripleChecker+Valid, 24185 SdHoareTripleChecker+Invalid, 9415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 9320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:09:50,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3211 Valid, 24185 Invalid, 9415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [95 Valid, 9320 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-01 15:09:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236157 states. [2022-03-01 15:09:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236157 to 141509. [2022-03-01 15:09:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141509 states, 141505 states have (on average 3.0887106462669163) internal successors, (437068), 141508 states have internal predecessors, (437068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141509 states to 141509 states and 437068 transitions. [2022-03-01 15:09:55,332 INFO L78 Accepts]: Start accepts. Automaton has 141509 states and 437068 transitions. Word has length 105 [2022-03-01 15:09:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:09:55,332 INFO L470 AbstractCegarLoop]: Abstraction has 141509 states and 437068 transitions. [2022-03-01 15:09:55,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:09:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 141509 states and 437068 transitions. [2022-03-01 15:09:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:09:55,485 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:09:55,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:09:55,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-01 15:09:55,486 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:09:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:09:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1588554697, now seen corresponding path program 35 times [2022-03-01 15:09:55,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:09:55,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965398809] [2022-03-01 15:09:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:09:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:09:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:09:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:09:56,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:09:56,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965398809] [2022-03-01 15:09:56,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965398809] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:09:56,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:09:56,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:09:56,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371593042] [2022-03-01 15:09:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:09:56,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:09:56,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:09:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:09:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:09:56,105 INFO L87 Difference]: Start difference. First operand 141509 states and 437068 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:10:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:10:04,029 INFO L93 Difference]: Finished difference Result 170978 states and 526669 transitions. [2022-03-01 15:10:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:10:04,030 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:10:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:10:04,556 INFO L225 Difference]: With dead ends: 170978 [2022-03-01 15:10:04,556 INFO L226 Difference]: Without dead ends: 170978 [2022-03-01 15:10:04,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-01 15:10:04,557 INFO L933 BasicCegarLoop]: 1047 mSDtfsCounter, 3152 mSDsluCounter, 11632 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3152 SdHoareTripleChecker+Valid, 12679 SdHoareTripleChecker+Invalid, 4789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:10:04,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3152 Valid, 12679 Invalid, 4789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:10:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170978 states. [2022-03-01 15:10:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170978 to 142129. [2022-03-01 15:10:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142129 states, 142125 states have (on average 3.0888513632365875) internal successors, (439003), 142128 states have internal predecessors, (439003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:10:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142129 states to 142129 states and 439003 transitions. [2022-03-01 15:10:08,991 INFO L78 Accepts]: Start accepts. Automaton has 142129 states and 439003 transitions. Word has length 105 [2022-03-01 15:10:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:10:08,991 INFO L470 AbstractCegarLoop]: Abstraction has 142129 states and 439003 transitions. [2022-03-01 15:10:08,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:10:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 142129 states and 439003 transitions. [2022-03-01 15:10:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:10:09,162 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:10:09,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:10:09,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-01 15:10:09,162 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:10:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:10:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995067, now seen corresponding path program 36 times [2022-03-01 15:10:09,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:10:09,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704052548] [2022-03-01 15:10:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:10:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:10:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:10:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:10:09,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:10:09,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704052548] [2022-03-01 15:10:09,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704052548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:10:09,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:10:09,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:10:09,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043018588] [2022-03-01 15:10:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:10:09,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:10:09,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:10:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:10:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:10:09,782 INFO L87 Difference]: Start difference. First operand 142129 states and 439003 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:10:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:10:20,215 INFO L93 Difference]: Finished difference Result 178280 states and 549214 transitions. [2022-03-01 15:10:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 15:10:20,216 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:10:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:10:21,077 INFO L225 Difference]: With dead ends: 178280 [2022-03-01 15:10:21,078 INFO L226 Difference]: Without dead ends: 178280 [2022-03-01 15:10:21,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:10:21,078 INFO L933 BasicCegarLoop]: 1332 mSDtfsCounter, 2897 mSDsluCounter, 13545 mSDsCounter, 0 mSdLazyCounter, 5391 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 14877 SdHoareTripleChecker+Invalid, 5462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 5391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-01 15:10:21,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2897 Valid, 14877 Invalid, 5462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 5391 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-01 15:10:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178280 states. [2022-03-01 15:10:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178280 to 142625. [2022-03-01 15:10:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142625 states, 142621 states have (on average 3.0890401834231986) internal successors, (440562), 142624 states have internal predecessors, (440562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:10:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142625 states to 142625 states and 440562 transitions. [2022-03-01 15:10:25,138 INFO L78 Accepts]: Start accepts. Automaton has 142625 states and 440562 transitions. Word has length 105 [2022-03-01 15:10:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:10:25,138 INFO L470 AbstractCegarLoop]: Abstraction has 142625 states and 440562 transitions. [2022-03-01 15:10:25,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:10:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 142625 states and 440562 transitions. [2022-03-01 15:10:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:10:25,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:10:25,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:10:25,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-01 15:10:25,766 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:10:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:10:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1678675625, now seen corresponding path program 37 times [2022-03-01 15:10:25,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:10:25,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835345991] [2022-03-01 15:10:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:10:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:10:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:10:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:10:26,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:10:26,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835345991] [2022-03-01 15:10:26,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835345991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:10:26,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:10:26,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:10:26,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186303050] [2022-03-01 15:10:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:10:26,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:10:26,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:10:26,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:10:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:10:26,411 INFO L87 Difference]: Start difference. First operand 142625 states and 440562 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-01 15:10:32,964 WARN L244 SmtUtils]: Removed 54 from assertion stack [2022-03-01 15:10:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 15:10:32,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1530, Invalid=3440, Unknown=0, NotChecked=0, Total=4970 [2022-03-01 15:10:32,965 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 1603 mSDsluCounter, 5580 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 6120 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:10:32,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1603 Valid, 6120 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 15:10:32,967 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-03-01 15:10:32,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-01 15:10:32,967 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (142625states) and FLOYD_HOARE automaton (currently 47 states, 28 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 125 for 16ms.. [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-03-01 15:10:32,969 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-03-01 15:10:32,972 INFO L732 BasicCegarLoop]: Path program histogram: [37, 3, 1] [2022-03-01 15:10:32,975 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 15:10:32,975 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 15:10:32,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 03:10:32 BasicIcfg [2022-03-01 15:10:32,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 15:10:32,977 INFO L158 Benchmark]: Toolchain (without parser) took 658269.63ms. Allocated memory was 187.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 135.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2022-03-01 15:10:32,977 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 15:10:32,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.32ms. Allocated memory is still 187.7MB. Free memory was 134.8MB in the beginning and 140.2MB in the end (delta: -5.4MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-03-01 15:10:32,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.10ms. Allocated memory is still 187.7MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 15:10:32,977 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 187.7MB. Free memory was 137.1MB in the beginning and 135.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 15:10:32,978 INFO L158 Benchmark]: RCFGBuilder took 518.63ms. Allocated memory is still 187.7MB. Free memory was 135.0MB in the beginning and 116.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-01 15:10:32,978 INFO L158 Benchmark]: TraceAbstraction took 657063.23ms. Allocated memory was 187.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 116.1MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2022-03-01 15:10:32,978 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 578.32ms. Allocated memory is still 187.7MB. Free memory was 134.8MB in the beginning and 140.2MB in the end (delta: -5.4MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.10ms. Allocated memory is still 187.7MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 187.7MB. Free memory was 137.1MB in the beginning and 135.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 518.63ms. Allocated memory is still 187.7MB. Free memory was 135.0MB in the beginning and 116.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 657063.23ms. Allocated memory was 187.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 116.1MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 3.7GB. 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 (142625states) and FLOYD_HOARE automaton (currently 47 states, 28 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 125 for 16ms.. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (142625states) and FLOYD_HOARE automaton (currently 47 states, 28 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 125 for 16ms.. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (142625states) and FLOYD_HOARE automaton (currently 47 states, 28 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 125 for 16ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (142625states) and FLOYD_HOARE automaton (currently 47 states, 28 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 125 for 16ms.. - 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 (142625states) and FLOYD_HOARE automaton (currently 47 states, 28 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 125 for 16ms.. - 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 (142625states) and FLOYD_HOARE automaton (currently 47 states, 28 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 125 for 16ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 318 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 656.9s, OverallIterations: 41, TraceHistogramMax: 1, PathProgramHistogramMax: 37, EmptinessCheckTime: 10.3s, AutomataDifference: 439.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119058 SdHoareTripleChecker+Valid, 87.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119058 mSDsluCounter, 515109 SdHoareTripleChecker+Invalid, 72.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463347 mSDsCounter, 3342 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191516 IncrementalHoareTripleChecker+Invalid, 194858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3342 mSolverCounterUnsat, 51762 mSDtfsCounter, 191516 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3433 GetRequests, 142 SyntacticMatches, 10 SemanticMatches, 3280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49059 ImplicationChecksByTransitivity, 278.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166884occurred in iteration=13, InterpolantAutomatonStates: 2344, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 175.6s AutomataMinimizationTime, 40 MinimizatonAttempts, 2284053 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 4232 NumberOfCodeBlocks, 4232 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4191 ConstructedInterpolants, 0 QuantifiedInterpolants, 64385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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