/usr/bin/java -Xmx16000000000 -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-dev-bc79526 [2022-01-17 23:42:00,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-17 23:42:00,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-17 23:42:00,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-17 23:42:00,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-17 23:42:00,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-17 23:42:00,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-17 23:42:00,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-17 23:42:00,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-17 23:42:00,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-17 23:42:00,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-17 23:42:00,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-17 23:42:00,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-17 23:42:00,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-17 23:42:00,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-17 23:42:00,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-17 23:42:00,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-17 23:42:00,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-17 23:42:00,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-17 23:42:00,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-17 23:42:00,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-17 23:42:00,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-17 23:42:00,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-17 23:42:00,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-17 23:42:00,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-17 23:42:00,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-17 23:42:00,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-17 23:42:00,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-17 23:42:00,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-17 23:42:00,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-17 23:42:00,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-17 23:42:00,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-17 23:42:00,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-17 23:42:00,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-17 23:42:00,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-17 23:42:00,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-17 23:42:00,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-17 23:42:00,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-17 23:42:00,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-17 23:42:00,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-17 23:42:00,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-17 23:42:00,565 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-01-17 23:42:00,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-17 23:42:00,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-17 23:42:00,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-17 23:42:00,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-17 23:42:00,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-17 23:42:00,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-17 23:42:00,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-17 23:42:00,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-17 23:42:00,587 INFO L138 SettingsManager]: * Use SBE=true [2022-01-17 23:42:00,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-17 23:42:00,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-17 23:42:00,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-17 23:42:00,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-17 23:42:00,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-17 23:42:00,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-17 23:42:00,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-17 23:42:00,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-17 23:42:00,590 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-17 23:42:00,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-17 23:42:00,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-17 23:42:00,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-17 23:42:00,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-17 23:42:00,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-17 23:42:00,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-17 23:42:00,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-17 23:42:00,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:42:00,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-17 23:42:00,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-17 23:42:00,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-17 23:42:00,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-17 23:42:00,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-17 23:42:00,593 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-17 23:42:00,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-17 23:42:00,593 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-01-17 23:42:00,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-17 23:42:00,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-17 23:42:00,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-17 23:42:00,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-17 23:42:00,827 INFO L275 PluginConnector]: CDTParser initialized [2022-01-17 23:42:00,828 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-01-17 23:42:00,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6436c291c/4a14beae6fda49358136cf149a22af1d/FLAGc30182f7f [2022-01-17 23:42:01,258 INFO L306 CDTParser]: Found 1 translation units. [2022-01-17 23:42:01,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-01-17 23:42:01,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6436c291c/4a14beae6fda49358136cf149a22af1d/FLAGc30182f7f [2022-01-17 23:42:01,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6436c291c/4a14beae6fda49358136cf149a22af1d [2022-01-17 23:42:01,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-17 23:42:01,602 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-17 23:42:01,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-17 23:42:01,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-17 23:42:01,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-17 23:42:01,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:42:01" (1/1) ... [2022-01-17 23:42:01,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f954bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:01, skipping insertion in model container [2022-01-17 23:42:01,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:42:01" (1/1) ... [2022-01-17 23:42:01,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-17 23:42:01,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-17 23:42:01,811 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-17 23:42:02,016 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-01-17 23:42:02,020 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-01-17 23:42:02,020 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-01-17 23:42:02,091 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-01-17 23:42:02,092 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-01-17 23:42:02,094 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-01-17 23:42:02,095 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-01-17 23:42:02,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:42:02,112 INFO L203 MainTranslator]: Completed pre-run [2022-01-17 23:42:02,128 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-17 23:42:02,153 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-01-17 23:42:02,154 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-01-17 23:42:02,155 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-01-17 23:42:02,171 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-01-17 23:42:02,172 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-01-17 23:42:02,179 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-01-17 23:42:02,180 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-01-17 23:42:02,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:42:02,246 INFO L208 MainTranslator]: Completed translation [2022-01-17 23:42:02,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02 WrapperNode [2022-01-17 23:42:02,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-17 23:42:02,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-17 23:42:02,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-17 23:42:02,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-17 23:42:02,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,297 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2022-01-17 23:42:02,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-17 23:42:02,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-17 23:42:02,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-17 23:42:02,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-17 23:42:02,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-17 23:42:02,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-17 23:42:02,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-17 23:42:02,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-17 23:42:02,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (1/1) ... [2022-01-17 23:42:02,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:42:02,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 23:42:02,377 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-01-17 23:42:02,402 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-01-17 23:42:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-01-17 23:42:02,417 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-01-17 23:42:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-01-17 23:42:02,417 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-01-17 23:42:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-17 23:42:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-17 23:42:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-17 23:42:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-17 23:42:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-17 23:42:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-17 23:42:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-17 23:42:02,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-17 23:42:02,419 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-17 23:42:02,556 INFO L234 CfgBuilder]: Building ICFG [2022-01-17 23:42:02,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-17 23:42:02,819 INFO L275 CfgBuilder]: Performing block encoding [2022-01-17 23:42:02,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-17 23:42:02,831 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-17 23:42:02,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:42:02 BoogieIcfgContainer [2022-01-17 23:42:02,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-17 23:42:02,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-17 23:42:02,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-17 23:42:02,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-17 23:42:02,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.01 11:42:01" (1/3) ... [2022-01-17 23:42:02,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be72fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:42:02, skipping insertion in model container [2022-01-17 23:42:02,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:42:02" (2/3) ... [2022-01-17 23:42:02,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be72fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:42:02, skipping insertion in model container [2022-01-17 23:42:02,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:42:02" (3/3) ... [2022-01-17 23:42:02,841 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-01-17 23:42:02,845 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-17 23:42:02,845 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-17 23:42:02,846 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-17 23:42:02,846 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-17 23:42:02,904 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,905 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,906 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,907 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,907 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,907 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,908 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,909 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,909 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,909 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,910 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,919 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,919 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,921 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,921 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,922 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,922 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,922 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,922 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,922 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,923 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,923 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,924 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,924 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,924 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,925 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,926 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,927 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,927 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,930 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,933 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,934 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,935 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,936 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,937 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,938 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,939 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,940 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,941 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,942 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,943 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,943 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,943 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,945 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,946 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,946 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,946 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,946 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,946 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,947 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,947 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,947 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,947 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,947 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,947 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,947 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,948 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,948 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,948 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,950 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,950 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,950 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,950 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,950 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,951 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,951 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,951 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,951 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,951 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,951 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,951 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,952 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,952 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,952 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,952 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,952 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,952 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,953 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,953 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,953 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,953 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,953 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,954 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,954 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,954 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,954 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,954 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,954 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,954 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,955 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,960 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,962 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,963 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,963 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,963 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,963 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,963 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,963 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,964 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,965 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,966 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,967 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,968 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,969 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,970 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,971 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,975 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,976 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,977 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,978 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,979 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,980 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,982 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,983 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,983 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,983 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,983 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,983 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,983 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,983 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,984 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,984 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,984 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,984 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,984 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,984 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,985 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,985 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,985 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,985 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,985 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,985 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,986 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,987 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,988 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,989 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,989 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,989 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,989 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,989 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,989 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,989 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,990 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,991 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,992 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,993 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,994 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,995 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,996 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,997 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,997 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,998 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:02,999 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,001 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,002 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,002 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,002 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,002 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,002 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,002 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,002 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,003 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,004 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,004 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,004 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,004 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,004 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,004 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,005 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,005 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,005 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,005 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,005 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,005 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,006 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,006 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,006 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,006 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,006 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,006 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,010 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,011 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,011 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,011 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,011 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,011 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,011 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,011 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,012 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,013 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,014 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,015 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,015 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,017 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,018 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,019 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:42:03,023 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-17 23:42:03,060 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-17 23:42:03,065 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-17 23:42:03,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-01-17 23:42:03,077 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 210 places, 220 transitions, 456 flow [2022-01-17 23:42:05,780 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-01-17 23:42:06,034 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-01-17 23:42:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-17 23:42:06,219 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:06,219 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-01-17 23:42:06,220 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-01-17 23:42:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1408739966, now seen corresponding path program 1 times [2022-01-17 23:42:06,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:06,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455271359] [2022-01-17 23:42:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:06,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:42:06,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455271359] [2022-01-17 23:42:06,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455271359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:06,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:06,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-17 23:42:06,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931377530] [2022-01-17 23:42:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:06,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-17 23:42:06,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:06,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-17 23:42:06,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-17 23:42:07,001 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-01-17 23:42:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:10,103 INFO L93 Difference]: Finished difference Result 101011 states and 310954 transitions. [2022-01-17 23:42:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-17 23:42:10,112 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-01-17 23:42:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:10,668 INFO L225 Difference]: With dead ends: 101011 [2022-01-17 23:42:10,668 INFO L226 Difference]: Without dead ends: 100951 [2022-01-17 23:42:10,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-01-17 23:42:10,673 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1127 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:10,674 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.8s Time] [2022-01-17 23:42:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100951 states. [2022-01-17 23:42:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100951 to 95266. [2022-01-17 23:42:13,913 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-01-17 23:42:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95266 states to 95266 states and 293479 transitions. [2022-01-17 23:42:14,444 INFO L78 Accepts]: Start accepts. Automaton has 95266 states and 293479 transitions. Word has length 83 [2022-01-17 23:42:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:14,444 INFO L470 AbstractCegarLoop]: Abstraction has 95266 states and 293479 transitions. [2022-01-17 23:42:14,444 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-01-17 23:42:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 95266 states and 293479 transitions. [2022-01-17 23:42:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-17 23:42:14,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:14,587 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-01-17 23:42:14,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-17 23:42:14,588 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-01-17 23:42:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash -176902823, now seen corresponding path program 1 times [2022-01-17 23:42:14,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:14,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890002099] [2022-01-17 23:42:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:14,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:42:15,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:15,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890002099] [2022-01-17 23:42:15,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890002099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:15,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:15,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-17 23:42:15,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615266456] [2022-01-17 23:42:15,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:15,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-17 23:42:15,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-17 23:42:15,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-01-17 23:42:15,313 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-01-17 23:42:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:19,242 INFO L93 Difference]: Finished difference Result 153195 states and 472281 transitions. [2022-01-17 23:42:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-17 23:42:19,256 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-01-17 23:42:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:19,986 INFO L225 Difference]: With dead ends: 153195 [2022-01-17 23:42:19,986 INFO L226 Difference]: Without dead ends: 152229 [2022-01-17 23:42:19,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2022-01-17 23:42:19,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-01-17 23:42:19,989 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-01-17 23:42:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152229 states. [2022-01-17 23:42:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152229 to 120205. [2022-01-17 23:42:23,534 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-01-17 23:42:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120205 states to 120205 states and 370986 transitions. [2022-01-17 23:42:24,364 INFO L78 Accepts]: Start accepts. Automaton has 120205 states and 370986 transitions. Word has length 88 [2022-01-17 23:42:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:24,365 INFO L470 AbstractCegarLoop]: Abstraction has 120205 states and 370986 transitions. [2022-01-17 23:42:24,365 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-01-17 23:42:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 120205 states and 370986 transitions. [2022-01-17 23:42:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-17 23:42:24,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:24,430 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-01-17 23:42:24,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-17 23:42:24,431 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-01-17 23:42:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash 929430313, now seen corresponding path program 2 times [2022-01-17 23:42:24,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:24,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604116175] [2022-01-17 23:42:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:24,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:42:24,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:24,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604116175] [2022-01-17 23:42:24,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604116175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:24,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:24,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-17 23:42:24,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784457263] [2022-01-17 23:42:24,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:24,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-17 23:42:24,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-17 23:42:24,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-01-17 23:42:24,805 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-01-17 23:42:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:28,477 INFO L93 Difference]: Finished difference Result 159338 states and 491229 transitions. [2022-01-17 23:42:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-17 23:42:28,478 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-01-17 23:42:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:29,129 INFO L225 Difference]: With dead ends: 159338 [2022-01-17 23:42:29,129 INFO L226 Difference]: Without dead ends: 159086 [2022-01-17 23:42:29,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2022-01-17 23:42:29,131 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-01-17 23:42:29,131 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-01-17 23:42:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159086 states. [2022-01-17 23:42:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159086 to 118249. [2022-01-17 23:42:32,254 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-01-17 23:42:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118249 states to 118249 states and 364965 transitions. [2022-01-17 23:42:32,597 INFO L78 Accepts]: Start accepts. Automaton has 118249 states and 364965 transitions. Word has length 88 [2022-01-17 23:42:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:32,597 INFO L470 AbstractCegarLoop]: Abstraction has 118249 states and 364965 transitions. [2022-01-17 23:42:32,598 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-01-17 23:42:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 118249 states and 364965 transitions. [2022-01-17 23:42:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-17 23:42:32,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:32,668 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-01-17 23:42:32,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-17 23:42:32,669 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-01-17 23:42:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1579355583, now seen corresponding path program 3 times [2022-01-17 23:42:32,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:32,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606960089] [2022-01-17 23:42:32,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:32,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:42:33,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606960089] [2022-01-17 23:42:33,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606960089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:33,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:33,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-17 23:42:33,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703202629] [2022-01-17 23:42:33,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:33,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-17 23:42:33,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:33,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-17 23:42:33,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-01-17 23:42:33,148 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-01-17 23:42:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:36,027 INFO L93 Difference]: Finished difference Result 131753 states and 405812 transitions. [2022-01-17 23:42:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-17 23:42:36,027 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-01-17 23:42:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:36,780 INFO L225 Difference]: With dead ends: 131753 [2022-01-17 23:42:36,780 INFO L226 Difference]: Without dead ends: 131585 [2022-01-17 23:42:36,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=395, Invalid=1087, Unknown=0, NotChecked=0, Total=1482 [2022-01-17 23:42:36,782 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 2365 mSDsluCounter, 4154 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:42:36,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2365 Valid, 4741 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-17 23:42:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131585 states. [2022-01-17 23:42:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131585 to 111213. [2022-01-17 23:42:39,329 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-01-17 23:42:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111213 states to 111213 states and 342827 transitions. [2022-01-17 23:42:39,640 INFO L78 Accepts]: Start accepts. Automaton has 111213 states and 342827 transitions. Word has length 88 [2022-01-17 23:42:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:39,640 INFO L470 AbstractCegarLoop]: Abstraction has 111213 states and 342827 transitions. [2022-01-17 23:42:39,640 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-01-17 23:42:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 111213 states and 342827 transitions. [2022-01-17 23:42:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:42:39,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:39,737 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-01-17 23:42:39,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-17 23:42:39,737 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-01-17 23:42:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash -903700515, now seen corresponding path program 1 times [2022-01-17 23:42:39,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:39,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604955843] [2022-01-17 23:42:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:39,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:42:40,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604955843] [2022-01-17 23:42:40,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604955843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:40,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:40,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:42:40,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999505410] [2022-01-17 23:42:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:40,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:42:40,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:42:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:42:40,551 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-01-17 23:42:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:42:48,966 INFO L93 Difference]: Finished difference Result 163236 states and 502706 transitions. [2022-01-17 23:42:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:42:48,967 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-01-17 23:42:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:42:49,395 INFO L225 Difference]: With dead ends: 163236 [2022-01-17 23:42:49,395 INFO L226 Difference]: Without dead ends: 163236 [2022-01-17 23:42:49,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:42:49,397 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-01-17 23:42:49,397 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-01-17 23:42:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163236 states. [2022-01-17 23:42:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163236 to 112825. [2022-01-17 23:42:52,181 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-01-17 23:42:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112825 states to 112825 states and 347770 transitions. [2022-01-17 23:42:52,479 INFO L78 Accepts]: Start accepts. Automaton has 112825 states and 347770 transitions. Word has length 105 [2022-01-17 23:42:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:42:52,481 INFO L470 AbstractCegarLoop]: Abstraction has 112825 states and 347770 transitions. [2022-01-17 23:42:52,481 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-01-17 23:42:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 112825 states and 347770 transitions. [2022-01-17 23:42:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:42:53,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:42:53,168 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-01-17 23:42:53,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-17 23:42:53,168 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-01-17 23:42:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:42:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash -535260145, now seen corresponding path program 2 times [2022-01-17 23:42:53,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:42:53,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560766732] [2022-01-17 23:42:53,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:42:53,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:42:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:42:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:42:54,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:42:54,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560766732] [2022-01-17 23:42:54,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560766732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:42:54,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:42:54,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:42:54,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748650486] [2022-01-17 23:42:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:42:54,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:42:54,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:42:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:42:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:42:54,026 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-01-17 23:43:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:04,560 INFO L93 Difference]: Finished difference Result 170538 states and 525251 transitions. [2022-01-17 23:43:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-17 23:43:04,561 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-01-17 23:43:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:05,272 INFO L225 Difference]: With dead ends: 170538 [2022-01-17 23:43:05,272 INFO L226 Difference]: Without dead ends: 170538 [2022-01-17 23:43:05,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-17 23:43:05,274 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-01-17 23:43:05,274 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-01-17 23:43:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170538 states. [2022-01-17 23:43:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170538 to 113321. [2022-01-17 23:43:07,953 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-01-17 23:43:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113321 states to 113321 states and 349329 transitions. [2022-01-17 23:43:08,254 INFO L78 Accepts]: Start accepts. Automaton has 113321 states and 349329 transitions. Word has length 105 [2022-01-17 23:43:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:08,254 INFO L470 AbstractCegarLoop]: Abstraction has 113321 states and 349329 transitions. [2022-01-17 23:43:08,254 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-01-17 23:43:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 113321 states and 349329 transitions. [2022-01-17 23:43:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:43:08,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:08,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:43:08,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-17 23:43:08,351 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-01-17 23:43:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -813579587, now seen corresponding path program 3 times [2022-01-17 23:43:08,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7608405] [2022-01-17 23:43:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:08,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:43:09,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7608405] [2022-01-17 23:43:09,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7608405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:09,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:09,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:43:09,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708717048] [2022-01-17 23:43:09,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:09,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:43:09,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:09,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:43:09,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:43:09,220 INFO L87 Difference]: Start difference. First operand 113321 states and 349329 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:20,088 INFO L93 Difference]: Finished difference Result 168926 states and 520215 transitions. [2022-01-17 23:43:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-17 23:43:20,089 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-01-17 23:43:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:20,478 INFO L225 Difference]: With dead ends: 168926 [2022-01-17 23:43:20,478 INFO L226 Difference]: Without dead ends: 168926 [2022-01-17 23:43:20,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-01-17 23:43:20,479 INFO L933 BasicCegarLoop]: 1370 mSDtfsCounter, 2676 mSDsluCounter, 11206 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 12576 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:20,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2676 Valid, 12576 Invalid, 4544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-17 23:43:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168926 states. [2022-01-17 23:43:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168926 to 121350. [2022-01-17 23:43:23,288 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-01-17 23:43:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121350 states to 121350 states and 374335 transitions. [2022-01-17 23:43:24,116 INFO L78 Accepts]: Start accepts. Automaton has 121350 states and 374335 transitions. Word has length 105 [2022-01-17 23:43:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:24,116 INFO L470 AbstractCegarLoop]: Abstraction has 121350 states and 374335 transitions. [2022-01-17 23:43:24,116 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-01-17 23:43:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 121350 states and 374335 transitions. [2022-01-17 23:43:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:43:24,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:24,218 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-01-17 23:43:24,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-17 23:43:24,219 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-01-17 23:43:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash -357336867, now seen corresponding path program 4 times [2022-01-17 23:43:24,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:24,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758166833] [2022-01-17 23:43:24,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:24,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:43:24,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:24,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758166833] [2022-01-17 23:43:24,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758166833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:24,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:24,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:43:24,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825633513] [2022-01-17 23:43:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:24,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:43:24,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:24,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:43:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:43:24,895 INFO L87 Difference]: Start difference. First operand 121350 states and 374335 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:32,579 INFO L93 Difference]: Finished difference Result 181721 states and 560556 transitions. [2022-01-17 23:43:32,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 23:43:32,580 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-01-17 23:43:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:33,004 INFO L225 Difference]: With dead ends: 181721 [2022-01-17 23:43:33,005 INFO L226 Difference]: Without dead ends: 181721 [2022-01-17 23:43:33,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-17 23:43:33,006 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 3305 mSDsluCounter, 9668 mSDsCounter, 0 mSdLazyCounter, 3857 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3305 SdHoareTripleChecker+Valid, 10472 SdHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:33,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3305 Valid, 10472 Invalid, 3944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3857 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:43:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181721 states. [2022-01-17 23:43:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181721 to 128356. [2022-01-17 23:43:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128356 states, 128352 states have (on average 3.0888961605584644) internal successors, (396466), 128355 states have internal predecessors, (396466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128356 states to 128356 states and 396466 transitions. [2022-01-17 23:43:36,751 INFO L78 Accepts]: Start accepts. Automaton has 128356 states and 396466 transitions. Word has length 105 [2022-01-17 23:43:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:36,751 INFO L470 AbstractCegarLoop]: Abstraction has 128356 states and 396466 transitions. [2022-01-17 23:43:36,752 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-01-17 23:43:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 128356 states and 396466 transitions. [2022-01-17 23:43:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:43:36,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:36,864 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-01-17 23:43:36,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-17 23:43:36,864 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-01-17 23:43:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1485183559, now seen corresponding path program 5 times [2022-01-17 23:43:36,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:36,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144416530] [2022-01-17 23:43:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:36,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:43:37,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:37,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144416530] [2022-01-17 23:43:37,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144416530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:37,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:37,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:43:37,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962837816] [2022-01-17 23:43:37,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:37,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:43:37,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:43:37,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:43:37,545 INFO L87 Difference]: Start difference. First operand 128356 states and 396466 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:43:44,973 INFO L93 Difference]: Finished difference Result 181938 states and 560997 transitions. [2022-01-17 23:43:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:43:44,974 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-01-17 23:43:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:43:45,407 INFO L225 Difference]: With dead ends: 181938 [2022-01-17 23:43:45,407 INFO L226 Difference]: Without dead ends: 181938 [2022-01-17 23:43:45,408 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-01-17 23:43:45,409 INFO L933 BasicCegarLoop]: 946 mSDtfsCounter, 2843 mSDsluCounter, 10369 mSDsCounter, 0 mSdLazyCounter, 4091 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2843 SdHoareTripleChecker+Valid, 11315 SdHoareTripleChecker+Invalid, 4166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:43:45,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2843 Valid, 11315 Invalid, 4166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4091 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:43:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181938 states. [2022-01-17 23:43:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181938 to 129472. [2022-01-17 23:43:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129472 states, 129468 states have (on average 3.088407946365125) internal successors, (399850), 129471 states have internal predecessors, (399850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129472 states to 129472 states and 399850 transitions. [2022-01-17 23:43:49,252 INFO L78 Accepts]: Start accepts. Automaton has 129472 states and 399850 transitions. Word has length 105 [2022-01-17 23:43:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:43:49,252 INFO L470 AbstractCegarLoop]: Abstraction has 129472 states and 399850 transitions. [2022-01-17 23:43:49,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:43:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 129472 states and 399850 transitions. [2022-01-17 23:43:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:43:49,367 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:43:49,367 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-01-17 23:43:49,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-17 23:43:49,367 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-01-17 23:43:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:43:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash -635656309, now seen corresponding path program 6 times [2022-01-17 23:43:49,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:43:49,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691104818] [2022-01-17 23:43:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:43:49,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:43:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:43:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:43:50,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:43:50,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691104818] [2022-01-17 23:43:50,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691104818] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:43:50,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:43:50,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:43:50,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871930256] [2022-01-17 23:43:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:43:50,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:43:50,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:43:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:43:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:43:50,158 INFO L87 Difference]: Start difference. First operand 129472 states and 399850 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:02,211 INFO L93 Difference]: Finished difference Result 180054 states and 554885 transitions. [2022-01-17 23:44:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-17 23:44:02,212 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-01-17 23:44:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:02,627 INFO L225 Difference]: With dead ends: 180054 [2022-01-17 23:44:02,627 INFO L226 Difference]: Without dead ends: 180054 [2022-01-17 23:44:02,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-01-17 23:44:02,629 INFO L933 BasicCegarLoop]: 1505 mSDtfsCounter, 2735 mSDsluCounter, 14541 mSDsCounter, 0 mSdLazyCounter, 5738 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 16046 SdHoareTripleChecker+Invalid, 5829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:02,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2735 Valid, 16046 Invalid, 5829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5738 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-17 23:44:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180054 states. [2022-01-17 23:44:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180054 to 122838. [2022-01-17 23:44:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122838 states, 122834 states have (on average 3.0855626292394613) internal successors, (379012), 122837 states have internal predecessors, (379012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122838 states to 122838 states and 379012 transitions. [2022-01-17 23:44:06,369 INFO L78 Accepts]: Start accepts. Automaton has 122838 states and 379012 transitions. Word has length 105 [2022-01-17 23:44:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:06,370 INFO L470 AbstractCegarLoop]: Abstraction has 122838 states and 379012 transitions. [2022-01-17 23:44:06,370 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-01-17 23:44:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 122838 states and 379012 transitions. [2022-01-17 23:44:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:44:06,580 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:06,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:44:06,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-17 23:44:06,581 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-01-17 23:44:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash -694658595, now seen corresponding path program 7 times [2022-01-17 23:44:06,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773978843] [2022-01-17 23:44:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:06,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:44:07,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:07,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773978843] [2022-01-17 23:44:07,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773978843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:07,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:07,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:44:07,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327177969] [2022-01-17 23:44:07,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:07,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:44:07,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:07,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:44:07,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:44:07,388 INFO L87 Difference]: Start difference. First operand 122838 states and 379012 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:19,840 INFO L93 Difference]: Finished difference Result 170838 states and 526877 transitions. [2022-01-17 23:44:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-17 23:44:19,841 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-01-17 23:44:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:20,229 INFO L225 Difference]: With dead ends: 170838 [2022-01-17 23:44:20,230 INFO L226 Difference]: Without dead ends: 170838 [2022-01-17 23:44:20,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2748, Invalid=6564, Unknown=0, NotChecked=0, Total=9312 [2022-01-17 23:44:20,232 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3354 mSDsluCounter, 10968 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3354 SdHoareTripleChecker+Valid, 12502 SdHoareTripleChecker+Invalid, 4448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:20,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3354 Valid, 12502 Invalid, 4448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-17 23:44:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170838 states. [2022-01-17 23:44:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170838 to 136959. [2022-01-17 23:44:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136959 states, 136955 states have (on average 3.0877806578803257) internal successors, (422887), 136958 states have internal predecessors, (422887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136959 states to 136959 states and 422887 transitions. [2022-01-17 23:44:23,396 INFO L78 Accepts]: Start accepts. Automaton has 136959 states and 422887 transitions. Word has length 105 [2022-01-17 23:44:23,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:23,396 INFO L470 AbstractCegarLoop]: Abstraction has 136959 states and 422887 transitions. [2022-01-17 23:44:23,396 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-01-17 23:44:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 136959 states and 422887 transitions. [2022-01-17 23:44:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:44:24,121 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:24,121 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-01-17 23:44:24,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-17 23:44:24,121 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-01-17 23:44:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089269, now seen corresponding path program 8 times [2022-01-17 23:44:24,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:24,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704807134] [2022-01-17 23:44:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:24,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:44:24,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:24,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704807134] [2022-01-17 23:44:24,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704807134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:24,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:24,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:44:24,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342726582] [2022-01-17 23:44:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:24,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:44:24,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:44:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:44:24,941 INFO L87 Difference]: Start difference. First operand 136959 states and 422887 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:33,301 INFO L93 Difference]: Finished difference Result 230818 states and 714168 transitions. [2022-01-17 23:44:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 23:44:33,302 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-01-17 23:44:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:33,935 INFO L225 Difference]: With dead ends: 230818 [2022-01-17 23:44:33,935 INFO L226 Difference]: Without dead ends: 230818 [2022-01-17 23:44:33,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-17 23:44:33,936 INFO L933 BasicCegarLoop]: 808 mSDtfsCounter, 2851 mSDsluCounter, 11458 mSDsCounter, 0 mSdLazyCounter, 4950 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 12266 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:33,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2851 Valid, 12266 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4950 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-17 23:44:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230818 states. [2022-01-17 23:44:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230818 to 152180. [2022-01-17 23:44:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152180 states, 152176 states have (on average 3.0934115760698138) internal successors, (470743), 152179 states have internal predecessors, (470743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152180 states to 152180 states and 470743 transitions. [2022-01-17 23:44:39,357 INFO L78 Accepts]: Start accepts. Automaton has 152180 states and 470743 transitions. Word has length 105 [2022-01-17 23:44:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:39,357 INFO L470 AbstractCegarLoop]: Abstraction has 152180 states and 470743 transitions. [2022-01-17 23:44:39,357 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-01-17 23:44:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 152180 states and 470743 transitions. [2022-01-17 23:44:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:44:39,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:39,508 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-01-17 23:44:39,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-17 23:44:39,509 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-01-17 23:44:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash 496431157, now seen corresponding path program 9 times [2022-01-17 23:44:39,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:39,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823057124] [2022-01-17 23:44:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:39,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:44:40,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:40,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823057124] [2022-01-17 23:44:40,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823057124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:40,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:40,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:44:40,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765632138] [2022-01-17 23:44:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:40,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:44:40,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:40,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:44:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:44:40,218 INFO L87 Difference]: Start difference. First operand 152180 states and 470743 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:44:48,304 INFO L93 Difference]: Finished difference Result 231345 states and 715053 transitions. [2022-01-17 23:44:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:44:48,305 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-01-17 23:44:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:44:49,374 INFO L225 Difference]: With dead ends: 231345 [2022-01-17 23:44:49,375 INFO L226 Difference]: Without dead ends: 231345 [2022-01-17 23:44:49,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-17 23:44:49,376 INFO L933 BasicCegarLoop]: 941 mSDtfsCounter, 2822 mSDsluCounter, 10872 mSDsCounter, 0 mSdLazyCounter, 4645 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2822 SdHoareTripleChecker+Valid, 11813 SdHoareTripleChecker+Invalid, 4718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:44:49,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2822 Valid, 11813 Invalid, 4718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4645 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-17 23:44:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231345 states. [2022-01-17 23:44:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231345 to 154412. [2022-01-17 23:44:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154412 states, 154408 states have (on average 3.0925275892440807) internal successors, (477511), 154411 states have internal predecessors, (477511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154412 states to 154412 states and 477511 transitions. [2022-01-17 23:44:53,749 INFO L78 Accepts]: Start accepts. Automaton has 154412 states and 477511 transitions. Word has length 105 [2022-01-17 23:44:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:44:53,749 INFO L470 AbstractCegarLoop]: Abstraction has 154412 states and 477511 transitions. [2022-01-17 23:44:53,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:44:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 154412 states and 477511 transitions. [2022-01-17 23:44:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:44:53,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:44:53,981 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-01-17 23:44:53,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-17 23:44:53,981 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-01-17 23:44:53,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:44:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1624408711, now seen corresponding path program 10 times [2022-01-17 23:44:53,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:44:53,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125459960] [2022-01-17 23:44:53,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:44:53,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:44:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:44:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:44:54,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:44:54,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125459960] [2022-01-17 23:44:54,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125459960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:44:54,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:44:54,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:44:54,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282129242] [2022-01-17 23:44:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:44:54,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:44:54,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:44:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:44:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:44:54,929 INFO L87 Difference]: Start difference. First operand 154412 states and 477511 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:04,573 INFO L93 Difference]: Finished difference Result 220123 states and 680002 transitions. [2022-01-17 23:45:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 23:45:04,574 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-01-17 23:45:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:05,669 INFO L225 Difference]: With dead ends: 220123 [2022-01-17 23:45:05,669 INFO L226 Difference]: Without dead ends: 220123 [2022-01-17 23:45:05,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1477, Invalid=3635, Unknown=0, NotChecked=0, Total=5112 [2022-01-17 23:45:05,670 INFO L933 BasicCegarLoop]: 1119 mSDtfsCounter, 2851 mSDsluCounter, 11044 mSDsCounter, 0 mSdLazyCounter, 4739 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 12163 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:05,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2851 Valid, 12163 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4739 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-17 23:45:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220123 states. [2022-01-17 23:45:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220123 to 149049. [2022-01-17 23:45:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149049 states, 149045 states have (on average 3.0911603878023417) internal successors, (460722), 149048 states have internal predecessors, (460722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149049 states to 149049 states and 460722 transitions. [2022-01-17 23:45:09,378 INFO L78 Accepts]: Start accepts. Automaton has 149049 states and 460722 transitions. Word has length 105 [2022-01-17 23:45:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:09,378 INFO L470 AbstractCegarLoop]: Abstraction has 149049 states and 460722 transitions. [2022-01-17 23:45:09,378 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-01-17 23:45:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 149049 states and 460722 transitions. [2022-01-17 23:45:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:45:09,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:09,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:45:09,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-17 23:45:09,525 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-01-17 23:45:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1683410997, now seen corresponding path program 11 times [2022-01-17 23:45:09,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:09,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705962487] [2022-01-17 23:45:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:09,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:45:10,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:10,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705962487] [2022-01-17 23:45:10,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705962487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:10,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:10,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:45:10,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202400798] [2022-01-17 23:45:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:10,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:45:10,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:10,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:45:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:45:10,830 INFO L87 Difference]: Start difference. First operand 149049 states and 460722 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:23,365 INFO L93 Difference]: Finished difference Result 194929 states and 601772 transitions. [2022-01-17 23:45:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-17 23:45:23,366 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-01-17 23:45:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:23,922 INFO L225 Difference]: With dead ends: 194929 [2022-01-17 23:45:23,922 INFO L226 Difference]: Without dead ends: 194929 [2022-01-17 23:45:23,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2909, Invalid=6991, Unknown=0, NotChecked=0, Total=9900 [2022-01-17 23:45:23,923 INFO L933 BasicCegarLoop]: 1640 mSDtfsCounter, 2958 mSDsluCounter, 13264 mSDsCounter, 0 mSdLazyCounter, 5325 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 14904 SdHoareTripleChecker+Invalid, 5416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:23,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2958 Valid, 14904 Invalid, 5416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5325 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-17 23:45:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194929 states. [2022-01-17 23:45:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194929 to 136289. [2022-01-17 23:45:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136289 states, 136285 states have (on average 3.0891660857761307) internal successors, (421007), 136288 states have internal predecessors, (421007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136289 states to 136289 states and 421007 transitions. [2022-01-17 23:45:27,291 INFO L78 Accepts]: Start accepts. Automaton has 136289 states and 421007 transitions. Word has length 105 [2022-01-17 23:45:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:27,291 INFO L470 AbstractCegarLoop]: Abstraction has 136289 states and 421007 transitions. [2022-01-17 23:45:27,291 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-01-17 23:45:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 136289 states and 421007 transitions. [2022-01-17 23:45:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:45:27,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:27,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:45:27,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-17 23:45:27,420 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-01-17 23:45:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1090206221, now seen corresponding path program 12 times [2022-01-17 23:45:27,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:27,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370594592] [2022-01-17 23:45:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:27,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:45:28,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:28,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370594592] [2022-01-17 23:45:28,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370594592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:28,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:28,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:45:28,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327649305] [2022-01-17 23:45:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:28,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:45:28,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:45:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:45:28,053 INFO L87 Difference]: Start difference. First operand 136289 states and 421007 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:33,614 INFO L93 Difference]: Finished difference Result 184032 states and 567783 transitions. [2022-01-17 23:45:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-17 23:45:33,614 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-01-17 23:45:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:34,068 INFO L225 Difference]: With dead ends: 184032 [2022-01-17 23:45:34,068 INFO L226 Difference]: Without dead ends: 184032 [2022-01-17 23:45:34,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-01-17 23:45:34,069 INFO L933 BasicCegarLoop]: 780 mSDtfsCounter, 2877 mSDsluCounter, 7977 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2877 SdHoareTripleChecker+Valid, 8757 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:34,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2877 Valid, 8757 Invalid, 3506 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [90 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-17 23:45:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184032 states. [2022-01-17 23:45:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184032 to 145961. [2022-01-17 23:45:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145961 states, 145957 states have (on average 3.0926163185047653) internal successors, (451389), 145960 states have internal predecessors, (451389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145961 states to 145961 states and 451389 transitions. [2022-01-17 23:45:38,282 INFO L78 Accepts]: Start accepts. Automaton has 145961 states and 451389 transitions. Word has length 105 [2022-01-17 23:45:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:38,283 INFO L470 AbstractCegarLoop]: Abstraction has 145961 states and 451389 transitions. [2022-01-17 23:45:38,283 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-01-17 23:45:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 145961 states and 451389 transitions. [2022-01-17 23:45:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:45:38,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:38,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-01-17 23:45:38,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-17 23:45:38,438 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-01-17 23:45:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash 811886779, now seen corresponding path program 13 times [2022-01-17 23:45:38,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:38,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915233981] [2022-01-17 23:45:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:38,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:45:39,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:39,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915233981] [2022-01-17 23:45:39,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915233981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:39,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:39,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:45:39,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399319003] [2022-01-17 23:45:39,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:39,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:45:39,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:39,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:45:39,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:45:39,168 INFO L87 Difference]: Start difference. First operand 145961 states and 451389 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:45:46,810 INFO L93 Difference]: Finished difference Result 191131 states and 590890 transitions. [2022-01-17 23:45:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-17 23:45:46,811 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-01-17 23:45:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:45:47,279 INFO L225 Difference]: With dead ends: 191131 [2022-01-17 23:45:47,280 INFO L226 Difference]: Without dead ends: 191131 [2022-01-17 23:45:47,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1211, Invalid=3079, Unknown=0, NotChecked=0, Total=4290 [2022-01-17 23:45:47,280 INFO L933 BasicCegarLoop]: 994 mSDtfsCounter, 2379 mSDsluCounter, 8971 mSDsCounter, 0 mSdLazyCounter, 3841 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 9965 SdHoareTripleChecker+Invalid, 3919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:45:47,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2379 Valid, 9965 Invalid, 3919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3841 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:45:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191131 states. [2022-01-17 23:45:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191131 to 145651. [2022-01-17 23:45:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145651 states, 145647 states have (on average 3.0923191002904282) internal successors, (450387), 145650 states have internal predecessors, (450387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:45:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145651 states to 145651 states and 450387 transitions. [2022-01-17 23:45:51,539 INFO L78 Accepts]: Start accepts. Automaton has 145651 states and 450387 transitions. Word has length 105 [2022-01-17 23:45:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:45:51,540 INFO L470 AbstractCegarLoop]: Abstraction has 145651 states and 450387 transitions. [2022-01-17 23:45:51,540 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-01-17 23:45:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 145651 states and 450387 transitions. [2022-01-17 23:45:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:45:51,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:45:51,783 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-01-17 23:45:51,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-17 23:45:51,783 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-01-17 23:45:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:45:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 752884493, now seen corresponding path program 14 times [2022-01-17 23:45:51,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:45:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798535022] [2022-01-17 23:45:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:45:51,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:45:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:45:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:45:52,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:45:52,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798535022] [2022-01-17 23:45:52,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798535022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:45:52,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:45:52,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:45:52,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730482484] [2022-01-17 23:45:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:45:52,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:45:52,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:45:52,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:45:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:45:52,566 INFO L87 Difference]: Start difference. First operand 145651 states and 450387 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:06,568 INFO L93 Difference]: Finished difference Result 178201 states and 549843 transitions. [2022-01-17 23:46:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-17 23:46:06,569 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-01-17 23:46:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:07,004 INFO L225 Difference]: With dead ends: 178201 [2022-01-17 23:46:07,004 INFO L226 Difference]: Without dead ends: 178201 [2022-01-17 23:46:07,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2980, Invalid=7322, Unknown=0, NotChecked=0, Total=10302 [2022-01-17 23:46:07,005 INFO L933 BasicCegarLoop]: 1671 mSDtfsCounter, 3086 mSDsluCounter, 16003 mSDsCounter, 0 mSdLazyCounter, 6668 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 17674 SdHoareTripleChecker+Invalid, 6769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 6668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:07,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3086 Valid, 17674 Invalid, 6769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 6668 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-17 23:46:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178201 states. [2022-01-17 23:46:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178201 to 140474. [2022-01-17 23:46:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140474 states, 140470 states have (on average 3.0907809496689684) internal successors, (434162), 140473 states have internal predecessors, (434162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140474 states to 140474 states and 434162 transitions. [2022-01-17 23:46:11,172 INFO L78 Accepts]: Start accepts. Automaton has 140474 states and 434162 transitions. Word has length 105 [2022-01-17 23:46:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:11,173 INFO L470 AbstractCegarLoop]: Abstraction has 140474 states and 434162 transitions. [2022-01-17 23:46:11,173 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-01-17 23:46:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 140474 states and 434162 transitions. [2022-01-17 23:46:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:46:11,323 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:11,323 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-01-17 23:46:11,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-17 23:46:11,323 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-01-17 23:46:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash -379588419, now seen corresponding path program 15 times [2022-01-17 23:46:11,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:11,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467885893] [2022-01-17 23:46:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:11,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:46:12,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:12,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467885893] [2022-01-17 23:46:12,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467885893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:12,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:12,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:46:12,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656209329] [2022-01-17 23:46:12,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:12,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:46:12,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:12,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:46:12,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:46:12,004 INFO L87 Difference]: Start difference. First operand 140474 states and 434162 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:25,748 INFO L93 Difference]: Finished difference Result 164426 states and 506766 transitions. [2022-01-17 23:46:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-17 23:46:25,748 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-01-17 23:46:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:26,141 INFO L225 Difference]: With dead ends: 164426 [2022-01-17 23:46:26,141 INFO L226 Difference]: Without dead ends: 164426 [2022-01-17 23:46:26,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3081, Invalid=7425, Unknown=0, NotChecked=0, Total=10506 [2022-01-17 23:46:26,142 INFO L933 BasicCegarLoop]: 1740 mSDtfsCounter, 2927 mSDsluCounter, 14182 mSDsCounter, 0 mSdLazyCounter, 5941 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2927 SdHoareTripleChecker+Valid, 15922 SdHoareTripleChecker+Invalid, 6029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 5941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:26,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2927 Valid, 15922 Invalid, 6029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 5941 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-17 23:46:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164426 states. [2022-01-17 23:46:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164426 to 128790. [2022-01-17 23:46:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128790 states, 128786 states have (on average 3.087369745158635) internal successors, (397610), 128789 states have internal predecessors, (397610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128790 states to 128790 states and 397610 transitions. [2022-01-17 23:46:29,399 INFO L78 Accepts]: Start accepts. Automaton has 128790 states and 397610 transitions. Word has length 105 [2022-01-17 23:46:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:29,399 INFO L470 AbstractCegarLoop]: Abstraction has 128790 states and 397610 transitions. [2022-01-17 23:46:29,399 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-01-17 23:46:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 128790 states and 397610 transitions. [2022-01-17 23:46:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:46:29,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:29,522 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-01-17 23:46:29,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-17 23:46:29,522 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-01-17 23:46:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1308959803, now seen corresponding path program 16 times [2022-01-17 23:46:29,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:29,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046170337] [2022-01-17 23:46:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:29,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:46:30,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:30,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046170337] [2022-01-17 23:46:30,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046170337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:30,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:30,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-17 23:46:30,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076061964] [2022-01-17 23:46:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:30,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-17 23:46:30,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:30,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-17 23:46:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-17 23:46:30,775 INFO L87 Difference]: Start difference. First operand 128790 states and 397610 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:36,584 INFO L93 Difference]: Finished difference Result 173781 states and 535095 transitions. [2022-01-17 23:46:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-17 23:46:36,584 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-01-17 23:46:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:37,011 INFO L225 Difference]: With dead ends: 173781 [2022-01-17 23:46:37,012 INFO L226 Difference]: Without dead ends: 173781 [2022-01-17 23:46:37,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1097, Invalid=2685, Unknown=0, NotChecked=0, Total=3782 [2022-01-17 23:46:37,012 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 2611 mSDsluCounter, 7615 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 8582 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:37,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2611 Valid, 8582 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2992 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-17 23:46:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173781 states. [2022-01-17 23:46:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173781 to 131239. [2022-01-17 23:46:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131239 states, 131235 states have (on average 3.0875985826951653) internal successors, (405201), 131238 states have internal predecessors, (405201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131239 states to 131239 states and 405201 transitions. [2022-01-17 23:46:40,365 INFO L78 Accepts]: Start accepts. Automaton has 131239 states and 405201 transitions. Word has length 105 [2022-01-17 23:46:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:40,366 INFO L470 AbstractCegarLoop]: Abstraction has 131239 states and 405201 transitions. [2022-01-17 23:46:40,366 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-01-17 23:46:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 131239 states and 405201 transitions. [2022-01-17 23:46:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:46:41,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:41,088 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-01-17 23:46:41,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-17 23:46:41,107 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-01-17 23:46:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1677400173, now seen corresponding path program 17 times [2022-01-17 23:46:41,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:41,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988127128] [2022-01-17 23:46:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:41,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:46:41,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988127128] [2022-01-17 23:46:41,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988127128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:41,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:41,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:46:41,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030552106] [2022-01-17 23:46:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:41,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:46:41,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:46:41,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:46:41,835 INFO L87 Difference]: Start difference. First operand 131239 states and 405201 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:46:52,643 INFO L93 Difference]: Finished difference Result 186601 states and 574575 transitions. [2022-01-17 23:46:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-17 23:46:52,643 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-01-17 23:46:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:46:53,101 INFO L225 Difference]: With dead ends: 186601 [2022-01-17 23:46:53,102 INFO L226 Difference]: Without dead ends: 186601 [2022-01-17 23:46:53,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-17 23:46:53,103 INFO L933 BasicCegarLoop]: 1335 mSDtfsCounter, 2782 mSDsluCounter, 16061 mSDsCounter, 0 mSdLazyCounter, 6420 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2782 SdHoareTripleChecker+Valid, 17396 SdHoareTripleChecker+Invalid, 6489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 6420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:46:53,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2782 Valid, 17396 Invalid, 6489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 6420 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-17 23:46:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186601 states. [2022-01-17 23:46:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186601 to 132355. [2022-01-17 23:46:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132355 states, 132351 states have (on average 3.087963067902774) internal successors, (408695), 132354 states have internal predecessors, (408695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:46:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132355 states to 132355 states and 408695 transitions. [2022-01-17 23:46:57,988 INFO L78 Accepts]: Start accepts. Automaton has 132355 states and 408695 transitions. Word has length 105 [2022-01-17 23:46:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:46:57,988 INFO L470 AbstractCegarLoop]: Abstraction has 132355 states and 408695 transitions. [2022-01-17 23:46:57,989 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-01-17 23:46:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 132355 states and 408695 transitions. [2022-01-17 23:46:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:46:58,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:46:58,157 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-01-17 23:46:58,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-17 23:46:58,157 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-01-17 23:46:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:46:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1399080731, now seen corresponding path program 18 times [2022-01-17 23:46:58,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:46:58,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037871142] [2022-01-17 23:46:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:46:58,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:46:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:46:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:46:58,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:46:58,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037871142] [2022-01-17 23:46:58,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037871142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:46:58,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:46:58,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:46:58,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024016484] [2022-01-17 23:46:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:46:58,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:46:58,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:46:58,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:46:58,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:46:58,860 INFO L87 Difference]: Start difference. First operand 132355 states and 408695 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:09,525 INFO L93 Difference]: Finished difference Result 186436 states and 574041 transitions. [2022-01-17 23:47:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-17 23:47:09,525 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-01-17 23:47:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:10,329 INFO L225 Difference]: With dead ends: 186436 [2022-01-17 23:47:10,330 INFO L226 Difference]: Without dead ends: 186436 [2022-01-17 23:47:10,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-01-17 23:47:10,331 INFO L933 BasicCegarLoop]: 1374 mSDtfsCounter, 2409 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 5180 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 13754 SdHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 5180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:10,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2409 Valid, 13754 Invalid, 5251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 5180 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-17 23:47:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186436 states. [2022-01-17 23:47:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186436 to 141355. [2022-01-17 23:47:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141355 states, 141351 states have (on average 3.0893803368918507) internal successors, (436687), 141354 states have internal predecessors, (436687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141355 states to 141355 states and 436687 transitions. [2022-01-17 23:47:13,906 INFO L78 Accepts]: Start accepts. Automaton has 141355 states and 436687 transitions. Word has length 105 [2022-01-17 23:47:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:13,906 INFO L470 AbstractCegarLoop]: Abstraction has 141355 states and 436687 transitions. [2022-01-17 23:47:13,906 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-01-17 23:47:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 141355 states and 436687 transitions. [2022-01-17 23:47:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:47:14,048 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:14,049 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-01-17 23:47:14,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-17 23:47:14,049 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-01-17 23:47:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1855323451, now seen corresponding path program 19 times [2022-01-17 23:47:14,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:14,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685206500] [2022-01-17 23:47:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:14,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:47:14,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685206500] [2022-01-17 23:47:14,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685206500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:14,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:14,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:47:14,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688557359] [2022-01-17 23:47:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:14,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:47:14,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:14,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:47:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:47:14,730 INFO L87 Difference]: Start difference. First operand 141355 states and 436687 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:22,356 INFO L93 Difference]: Finished difference Result 197081 states and 607845 transitions. [2022-01-17 23:47:22,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 23:47:22,356 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-01-17 23:47:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:22,897 INFO L225 Difference]: With dead ends: 197081 [2022-01-17 23:47:22,898 INFO L226 Difference]: Without dead ends: 197081 [2022-01-17 23:47:22,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-17 23:47:22,898 INFO L933 BasicCegarLoop]: 816 mSDtfsCounter, 3144 mSDsluCounter, 9309 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3144 SdHoareTripleChecker+Valid, 10125 SdHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:22,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3144 Valid, 10125 Invalid, 3884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-17 23:47:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197081 states. [2022-01-17 23:47:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197081 to 148361. [2022-01-17 23:47:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148361 states, 148357 states have (on average 3.092661620280809) internal successors, (458818), 148360 states have internal predecessors, (458818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148361 states to 148361 states and 458818 transitions. [2022-01-17 23:47:27,252 INFO L78 Accepts]: Start accepts. Automaton has 148361 states and 458818 transitions. Word has length 105 [2022-01-17 23:47:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:27,253 INFO L470 AbstractCegarLoop]: Abstraction has 148361 states and 458818 transitions. [2022-01-17 23:47:27,253 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-01-17 23:47:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 148361 states and 458818 transitions. [2022-01-17 23:47:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:47:27,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:27,411 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-01-17 23:47:27,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-17 23:47:27,411 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-01-17 23:47:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash -597123419, now seen corresponding path program 20 times [2022-01-17 23:47:27,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:27,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258013483] [2022-01-17 23:47:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:27,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:47:28,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:28,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258013483] [2022-01-17 23:47:28,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258013483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:28,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:28,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:47:28,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137850069] [2022-01-17 23:47:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:28,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:47:28,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:47:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:47:28,035 INFO L87 Difference]: Start difference. First operand 148361 states and 458818 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:35,566 INFO L93 Difference]: Finished difference Result 197298 states and 608286 transitions. [2022-01-17 23:47:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:47:35,566 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-01-17 23:47:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:36,104 INFO L225 Difference]: With dead ends: 197298 [2022-01-17 23:47:36,104 INFO L226 Difference]: Without dead ends: 197298 [2022-01-17 23:47:36,105 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-01-17 23:47:36,105 INFO L933 BasicCegarLoop]: 958 mSDtfsCounter, 2802 mSDsluCounter, 10000 mSDsCounter, 0 mSdLazyCounter, 4073 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2802 SdHoareTripleChecker+Valid, 10958 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:36,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2802 Valid, 10958 Invalid, 4143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4073 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:47:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197298 states. [2022-01-17 23:47:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197298 to 149477. [2022-01-17 23:47:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149477 states, 149473 states have (on average 3.092210633358533) internal successors, (462202), 149476 states have internal predecessors, (462202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149477 states to 149477 states and 462202 transitions. [2022-01-17 23:47:40,425 INFO L78 Accepts]: Start accepts. Automaton has 149477 states and 462202 transitions. Word has length 105 [2022-01-17 23:47:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:40,425 INFO L470 AbstractCegarLoop]: Abstraction has 149477 states and 462202 transitions. [2022-01-17 23:47:40,425 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-01-17 23:47:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 149477 states and 462202 transitions. [2022-01-17 23:47:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:47:40,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:40,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:47:40,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-17 23:47:40,596 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-01-17 23:47:40,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1577004009, now seen corresponding path program 21 times [2022-01-17 23:47:40,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853329308] [2022-01-17 23:47:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:40,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:47:41,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:41,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853329308] [2022-01-17 23:47:41,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853329308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:41,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:41,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:47:41,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655963314] [2022-01-17 23:47:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:41,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:47:41,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:47:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:47:41,379 INFO L87 Difference]: Start difference. First operand 149477 states and 462202 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:47:53,038 INFO L93 Difference]: Finished difference Result 197853 states and 609629 transitions. [2022-01-17 23:47:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-17 23:47:53,038 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-01-17 23:47:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:47:53,576 INFO L225 Difference]: With dead ends: 197853 [2022-01-17 23:47:53,576 INFO L226 Difference]: Without dead ends: 197853 [2022-01-17 23:47:53,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-01-17 23:47:53,577 INFO L933 BasicCegarLoop]: 1509 mSDtfsCounter, 2803 mSDsluCounter, 12568 mSDsCounter, 0 mSdLazyCounter, 5012 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 14077 SdHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:47:53,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2803 Valid, 14077 Invalid, 5103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5012 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-17 23:47:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197853 states. [2022-01-17 23:47:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197853 to 143556. [2022-01-17 23:47:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143556 states, 143552 states have (on average 3.0904201961658493) internal successors, (443636), 143555 states have internal predecessors, (443636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:47:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143556 states to 143556 states and 443636 transitions. [2022-01-17 23:47:57,195 INFO L78 Accepts]: Start accepts. Automaton has 143556 states and 443636 transitions. Word has length 105 [2022-01-17 23:47:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:47:57,195 INFO L470 AbstractCegarLoop]: Abstraction has 143556 states and 443636 transitions. [2022-01-17 23:47:57,195 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-01-17 23:47:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 143556 states and 443636 transitions. [2022-01-17 23:47:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:47:57,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:47:57,950 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-01-17 23:47:57,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-17 23:47:57,950 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-01-17 23:47:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:47:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1518001723, now seen corresponding path program 22 times [2022-01-17 23:47:57,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:47:57,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990620132] [2022-01-17 23:47:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:47:57,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:47:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:47:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:47:58,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:47:58,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990620132] [2022-01-17 23:47:58,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990620132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:47:58,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:47:58,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:47:58,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393227203] [2022-01-17 23:47:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:47:58,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:47:58,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:47:58,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:47:58,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:47:58,815 INFO L87 Difference]: Start difference. First operand 143556 states and 443636 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:09,588 INFO L93 Difference]: Finished difference Result 189514 states and 583621 transitions. [2022-01-17 23:48:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-17 23:48:09,589 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-01-17 23:48:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:10,081 INFO L225 Difference]: With dead ends: 189514 [2022-01-17 23:48:10,081 INFO L226 Difference]: Without dead ends: 189514 [2022-01-17 23:48:10,081 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-01-17 23:48:10,082 INFO L933 BasicCegarLoop]: 1538 mSDtfsCounter, 2664 mSDsluCounter, 12653 mSDsCounter, 0 mSdLazyCounter, 5105 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 14191 SdHoareTripleChecker+Invalid, 5184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 5105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:10,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2664 Valid, 14191 Invalid, 5184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 5105 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-17 23:48:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189514 states. [2022-01-17 23:48:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189514 to 142533. [2022-01-17 23:48:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142533 states, 142529 states have (on average 3.0900658813294135) internal successors, (440424), 142532 states have internal predecessors, (440424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142533 states to 142533 states and 440424 transitions. [2022-01-17 23:48:14,340 INFO L78 Accepts]: Start accepts. Automaton has 142533 states and 440424 transitions. Word has length 105 [2022-01-17 23:48:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:14,341 INFO L470 AbstractCegarLoop]: Abstraction has 142533 states and 440424 transitions. [2022-01-17 23:48:14,341 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-01-17 23:48:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 142533 states and 440424 transitions. [2022-01-17 23:48:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:48:14,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:14,492 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-01-17 23:48:14,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-17 23:48:14,492 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-01-17 23:48:14,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash 866571049, now seen corresponding path program 23 times [2022-01-17 23:48:14,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:14,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349586724] [2022-01-17 23:48:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:14,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:48:15,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:15,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349586724] [2022-01-17 23:48:15,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349586724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:15,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:15,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:48:15,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416519169] [2022-01-17 23:48:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:15,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:48:15,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:48:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:48:15,145 INFO L87 Difference]: Start difference. First operand 142533 states and 440424 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:23,094 INFO L93 Difference]: Finished difference Result 232790 states and 719209 transitions. [2022-01-17 23:48:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 23:48:23,095 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-01-17 23:48:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:23,764 INFO L225 Difference]: With dead ends: 232790 [2022-01-17 23:48:23,765 INFO L226 Difference]: Without dead ends: 232790 [2022-01-17 23:48:23,765 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-01-17 23:48:23,766 INFO L933 BasicCegarLoop]: 820 mSDtfsCounter, 2984 mSDsluCounter, 9701 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2984 SdHoareTripleChecker+Valid, 10521 SdHoareTripleChecker+Invalid, 4341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:23,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2984 Valid, 10521 Invalid, 4341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-17 23:48:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232790 states. [2022-01-17 23:48:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232790 to 153073. [2022-01-17 23:48:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153073 states, 153069 states have (on average 3.093761636908845) internal successors, (473559), 153072 states have internal predecessors, (473559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153073 states to 153073 states and 473559 transitions. [2022-01-17 23:48:28,443 INFO L78 Accepts]: Start accepts. Automaton has 153073 states and 473559 transitions. Word has length 105 [2022-01-17 23:48:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:28,443 INFO L470 AbstractCegarLoop]: Abstraction has 153073 states and 473559 transitions. [2022-01-17 23:48:28,443 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-01-17 23:48:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 153073 states and 473559 transitions. [2022-01-17 23:48:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:48:28,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:28,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:48:28,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-17 23:48:28,632 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-01-17 23:48:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1585875821, now seen corresponding path program 24 times [2022-01-17 23:48:28,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:28,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714202069] [2022-01-17 23:48:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:28,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:48:29,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:29,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714202069] [2022-01-17 23:48:29,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714202069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:29,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:29,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:48:29,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401890653] [2022-01-17 23:48:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:29,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:48:29,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:48:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:48:29,273 INFO L87 Difference]: Start difference. First operand 153073 states and 473559 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:37,577 INFO L93 Difference]: Finished difference Result 232325 states and 717241 transitions. [2022-01-17 23:48:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:48:37,578 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-01-17 23:48:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:38,676 INFO L225 Difference]: With dead ends: 232325 [2022-01-17 23:48:38,676 INFO L226 Difference]: Without dead ends: 232325 [2022-01-17 23:48:38,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-17 23:48:38,676 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 3124 mSDsluCounter, 10938 mSDsCounter, 0 mSdLazyCounter, 4770 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3124 SdHoareTripleChecker+Valid, 11891 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 4770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:38,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3124 Valid, 11891 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 4770 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-17 23:48:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232325 states. [2022-01-17 23:48:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232325 to 154189. [2022-01-17 23:48:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154189 states, 154185 states have (on average 3.0933164704737814) internal successors, (476943), 154188 states have internal predecessors, (476943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154189 states to 154189 states and 476943 transitions. [2022-01-17 23:48:42,616 INFO L78 Accepts]: Start accepts. Automaton has 154189 states and 476943 transitions. Word has length 105 [2022-01-17 23:48:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:42,616 INFO L470 AbstractCegarLoop]: Abstraction has 154189 states and 476943 transitions. [2022-01-17 23:48:42,616 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-01-17 23:48:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 154189 states and 476943 transitions. [2022-01-17 23:48:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:48:43,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:48:43,527 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-01-17 23:48:43,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-17 23:48:43,527 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-01-17 23:48:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:48:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash 588251607, now seen corresponding path program 25 times [2022-01-17 23:48:43,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:48:43,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041008177] [2022-01-17 23:48:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:48:43,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:48:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:48:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:48:44,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:48:44,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041008177] [2022-01-17 23:48:44,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041008177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:48:44,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:48:44,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:48:44,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970894939] [2022-01-17 23:48:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:48:44,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:48:44,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:48:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:48:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:48:44,199 INFO L87 Difference]: Start difference. First operand 154189 states and 476943 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:48:53,281 INFO L93 Difference]: Finished difference Result 226135 states and 697862 transitions. [2022-01-17 23:48:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 23:48:53,282 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-01-17 23:48:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:48:53,939 INFO L225 Difference]: With dead ends: 226135 [2022-01-17 23:48:53,939 INFO L226 Difference]: Without dead ends: 226135 [2022-01-17 23:48:53,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1480, Invalid=3632, Unknown=0, NotChecked=0, Total=5112 [2022-01-17 23:48:53,940 INFO L933 BasicCegarLoop]: 1131 mSDtfsCounter, 2615 mSDsluCounter, 10522 mSDsCounter, 0 mSdLazyCounter, 4628 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 11653 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:48:53,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2615 Valid, 11653 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4628 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-17 23:48:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226135 states. [2022-01-17 23:48:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226135 to 160854. [2022-01-17 23:48:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160854 states, 160850 states have (on average 3.094062791420578) internal successors, (497680), 160853 states have internal predecessors, (497680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:48:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160854 states to 160854 states and 497680 transitions. [2022-01-17 23:48:59,638 INFO L78 Accepts]: Start accepts. Automaton has 160854 states and 497680 transitions. Word has length 105 [2022-01-17 23:48:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:48:59,638 INFO L470 AbstractCegarLoop]: Abstraction has 160854 states and 497680 transitions. [2022-01-17 23:48:59,638 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-01-17 23:48:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 160854 states and 497680 transitions. [2022-01-17 23:49:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:49:00,047 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:00,047 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-01-17 23:49:00,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-17 23:49:00,048 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-01-17 23:49:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash 529249321, now seen corresponding path program 26 times [2022-01-17 23:49:00,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:00,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95450011] [2022-01-17 23:49:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:00,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:49:00,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:00,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95450011] [2022-01-17 23:49:00,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95450011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:00,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:00,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:49:00,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344001866] [2022-01-17 23:49:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:00,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:49:00,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:49:00,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:49:00,914 INFO L87 Difference]: Start difference. First operand 160854 states and 497680 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:14,164 INFO L93 Difference]: Finished difference Result 225624 states and 696169 transitions. [2022-01-17 23:49:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-17 23:49:14,165 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-01-17 23:49:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:14,808 INFO L225 Difference]: With dead ends: 225624 [2022-01-17 23:49:14,809 INFO L226 Difference]: Without dead ends: 225624 [2022-01-17 23:49:14,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2575, Invalid=6167, Unknown=0, NotChecked=0, Total=8742 [2022-01-17 23:49:14,809 INFO L933 BasicCegarLoop]: 1628 mSDtfsCounter, 2822 mSDsluCounter, 14594 mSDsCounter, 0 mSdLazyCounter, 6103 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2822 SdHoareTripleChecker+Valid, 16222 SdHoareTripleChecker+Invalid, 6188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 6103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:14,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2822 Valid, 16222 Invalid, 6188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 6103 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-17 23:49:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225624 states. [2022-01-17 23:49:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225624 to 159459. [2022-01-17 23:49:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159459 states, 159455 states have (on average 3.0946662067667994) internal successors, (493460), 159458 states have internal predecessors, (493460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159459 states to 159459 states and 493460 transitions. [2022-01-17 23:49:19,530 INFO L78 Accepts]: Start accepts. Automaton has 159459 states and 493460 transitions. Word has length 105 [2022-01-17 23:49:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:19,530 INFO L470 AbstractCegarLoop]: Abstraction has 159459 states and 493460 transitions. [2022-01-17 23:49:19,530 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-01-17 23:49:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 159459 states and 493460 transitions. [2022-01-17 23:49:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:49:19,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:19,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:49:19,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-17 23:49:19,746 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-01-17 23:49:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash -992100757, now seen corresponding path program 27 times [2022-01-17 23:49:19,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:19,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929897437] [2022-01-17 23:49:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:19,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:49:20,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:20,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929897437] [2022-01-17 23:49:20,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929897437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:20,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:20,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:49:20,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151766301] [2022-01-17 23:49:20,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:20,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:49:20,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:20,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:49:20,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:49:20,329 INFO L87 Difference]: Start difference. First operand 159459 states and 493460 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:28,888 INFO L93 Difference]: Finished difference Result 257941 states and 799431 transitions. [2022-01-17 23:49:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 23:49:28,889 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-01-17 23:49:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:30,195 INFO L225 Difference]: With dead ends: 257941 [2022-01-17 23:49:30,196 INFO L226 Difference]: Without dead ends: 257941 [2022-01-17 23:49:30,196 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-01-17 23:49:30,196 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 3329 mSDsluCounter, 10818 mSDsCounter, 0 mSdLazyCounter, 4934 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3329 SdHoareTripleChecker+Valid, 11641 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:30,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3329 Valid, 11641 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4934 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-17 23:49:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257941 states. [2022-01-17 23:49:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257941 to 172417. [2022-01-17 23:49:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172417 states, 172413 states have (on average 3.1041800792283643) internal successors, (535201), 172416 states have internal predecessors, (535201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172417 states to 172417 states and 535201 transitions. [2022-01-17 23:49:35,249 INFO L78 Accepts]: Start accepts. Automaton has 172417 states and 535201 transitions. Word has length 105 [2022-01-17 23:49:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:35,249 INFO L470 AbstractCegarLoop]: Abstraction has 172417 states and 535201 transitions. [2022-01-17 23:49:35,249 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-01-17 23:49:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 172417 states and 535201 transitions. [2022-01-17 23:49:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:49:35,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:35,476 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-01-17 23:49:35,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-17 23:49:35,476 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-01-17 23:49:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 850419669, now seen corresponding path program 28 times [2022-01-17 23:49:35,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:35,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561928541] [2022-01-17 23:49:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:35,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:49:36,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:36,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561928541] [2022-01-17 23:49:36,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561928541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:36,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:36,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:49:36,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505245840] [2022-01-17 23:49:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:36,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:49:36,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:49:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:49:36,131 INFO L87 Difference]: Start difference. First operand 172417 states and 535201 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:44,280 INFO L93 Difference]: Finished difference Result 244363 states and 756027 transitions. [2022-01-17 23:49:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-17 23:49:44,280 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-01-17 23:49:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:49:44,977 INFO L225 Difference]: With dead ends: 244363 [2022-01-17 23:49:44,977 INFO L226 Difference]: Without dead ends: 244363 [2022-01-17 23:49:44,978 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-01-17 23:49:44,978 INFO L933 BasicCegarLoop]: 956 mSDtfsCounter, 3042 mSDsluCounter, 10624 mSDsCounter, 0 mSdLazyCounter, 4703 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 11580 SdHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-17 23:49:44,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3042 Valid, 11580 Invalid, 4781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4703 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-17 23:49:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244363 states. [2022-01-17 23:49:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244363 to 163024. [2022-01-17 23:49:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163024 states, 163020 states have (on average 3.0961538461538463) internal successors, (504735), 163023 states have internal predecessors, (504735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163024 states to 163024 states and 504735 transitions. [2022-01-17 23:49:49,644 INFO L78 Accepts]: Start accepts. Automaton has 163024 states and 504735 transitions. Word has length 105 [2022-01-17 23:49:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:49:49,644 INFO L470 AbstractCegarLoop]: Abstraction has 163024 states and 504735 transitions. [2022-01-17 23:49:49,644 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-01-17 23:49:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 163024 states and 504735 transitions. [2022-01-17 23:49:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:49:49,842 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:49:49,842 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-01-17 23:49:49,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-17 23:49:49,842 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-01-17 23:49:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:49:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1270420199, now seen corresponding path program 29 times [2022-01-17 23:49:49,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:49:49,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984392081] [2022-01-17 23:49:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:49:49,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:49:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:49:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:49:51,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:49:51,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984392081] [2022-01-17 23:49:51,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984392081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:49:51,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:49:51,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:49:51,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396108107] [2022-01-17 23:49:51,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:49:51,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:49:51,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:49:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:49:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:49:51,385 INFO L87 Difference]: Start difference. First operand 163024 states and 504735 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:49:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:49:59,519 INFO L93 Difference]: Finished difference Result 228987 states and 707760 transitions. [2022-01-17 23:49:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-17 23:49:59,520 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-01-17 23:49:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:00,167 INFO L225 Difference]: With dead ends: 228987 [2022-01-17 23:50:00,167 INFO L226 Difference]: Without dead ends: 228987 [2022-01-17 23:50:00,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-01-17 23:50:00,168 INFO L933 BasicCegarLoop]: 1006 mSDtfsCounter, 2894 mSDsluCounter, 8962 mSDsCounter, 0 mSdLazyCounter, 3966 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 9968 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:00,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2894 Valid, 9968 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3966 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-17 23:50:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228987 states. [2022-01-17 23:50:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228987 to 164729. [2022-01-17 23:50:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164729 states, 164725 states have (on average 3.0964334496888752) internal successors, (510060), 164728 states have internal predecessors, (510060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164729 states to 164729 states and 510060 transitions. [2022-01-17 23:50:04,904 INFO L78 Accepts]: Start accepts. Automaton has 164729 states and 510060 transitions. Word has length 105 [2022-01-17 23:50:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:04,905 INFO L470 AbstractCegarLoop]: Abstraction has 164729 states and 510060 transitions. [2022-01-17 23:50:04,905 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-01-17 23:50:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 164729 states and 510060 transitions. [2022-01-17 23:50:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:50:05,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:05,114 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-01-17 23:50:05,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-17 23:50:05,114 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-01-17 23:50:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1329422485, now seen corresponding path program 30 times [2022-01-17 23:50:05,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:05,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382328955] [2022-01-17 23:50:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:05,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:50:05,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:05,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382328955] [2022-01-17 23:50:05,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382328955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:05,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:05,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:50:05,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480823337] [2022-01-17 23:50:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:05,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:50:05,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:50:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:50:05,720 INFO L87 Difference]: Start difference. First operand 164729 states and 510060 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:18,307 INFO L93 Difference]: Finished difference Result 217109 states and 669918 transitions. [2022-01-17 23:50:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-17 23:50:18,307 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-01-17 23:50:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:18,907 INFO L225 Difference]: With dead ends: 217109 [2022-01-17 23:50:18,907 INFO L226 Difference]: Without dead ends: 217109 [2022-01-17 23:50:18,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2594, Invalid=6148, Unknown=0, NotChecked=0, Total=8742 [2022-01-17 23:50:18,908 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 2982 mSDsluCounter, 13372 mSDsCounter, 0 mSdLazyCounter, 5716 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2982 SdHoareTripleChecker+Valid, 15039 SdHoareTripleChecker+Invalid, 5807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:18,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2982 Valid, 15039 Invalid, 5807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5716 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-17 23:50:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217109 states. [2022-01-17 23:50:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217109 to 136726. [2022-01-17 23:50:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136726 states, 136722 states have (on average 3.090204941413964) internal successors, (422499), 136725 states have internal predecessors, (422499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136726 states to 136726 states and 422499 transitions. [2022-01-17 23:50:23,312 INFO L78 Accepts]: Start accepts. Automaton has 136726 states and 422499 transitions. Word has length 105 [2022-01-17 23:50:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:23,312 INFO L470 AbstractCegarLoop]: Abstraction has 136726 states and 422499 transitions. [2022-01-17 23:50:23,312 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-01-17 23:50:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 136726 states and 422499 transitions. [2022-01-17 23:50:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:50:23,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:23,449 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-01-17 23:50:23,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-17 23:50:23,449 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-01-17 23:50:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1833071899, now seen corresponding path program 31 times [2022-01-17 23:50:23,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:23,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651356898] [2022-01-17 23:50:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:23,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:50:24,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:24,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651356898] [2022-01-17 23:50:24,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651356898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:24,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:24,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:50:24,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544607473] [2022-01-17 23:50:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:24,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:50:24,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:50:24,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:50:24,066 INFO L87 Difference]: Start difference. First operand 136726 states and 422499 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:50:39,129 INFO L93 Difference]: Finished difference Result 225893 states and 695481 transitions. [2022-01-17 23:50:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-01-17 23:50:39,130 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-01-17 23:50:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:50:40,132 INFO L225 Difference]: With dead ends: 225893 [2022-01-17 23:50:40,132 INFO L226 Difference]: Without dead ends: 225893 [2022-01-17 23:50:40,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=3961, Invalid=10319, Unknown=0, NotChecked=0, Total=14280 [2022-01-17 23:50:40,133 INFO L933 BasicCegarLoop]: 1901 mSDtfsCounter, 3624 mSDsluCounter, 12705 mSDsCounter, 0 mSdLazyCounter, 5260 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3624 SdHoareTripleChecker+Valid, 14606 SdHoareTripleChecker+Invalid, 5353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 5260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-17 23:50:40,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3624 Valid, 14606 Invalid, 5353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 5260 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-17 23:50:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225893 states. [2022-01-17 23:50:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225893 to 128821. [2022-01-17 23:50:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128821 states, 128817 states have (on average 3.0873564824518502) internal successors, (397704), 128820 states have internal predecessors, (397704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:50:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128821 states to 128821 states and 397704 transitions. [2022-01-17 23:50:43,716 INFO L78 Accepts]: Start accepts. Automaton has 128821 states and 397704 transitions. Word has length 105 [2022-01-17 23:50:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:50:43,716 INFO L470 AbstractCegarLoop]: Abstraction has 128821 states and 397704 transitions. [2022-01-17 23:50:43,716 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-01-17 23:50:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 128821 states and 397704 transitions. [2022-01-17 23:50:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:50:43,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:50:43,835 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-01-17 23:50:43,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-17 23:50:43,836 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-01-17 23:50:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:50:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1666350753, now seen corresponding path program 32 times [2022-01-17 23:50:43,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:50:43,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008909693] [2022-01-17 23:50:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:50:43,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:50:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:50:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:50:44,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:50:44,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008909693] [2022-01-17 23:50:44,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008909693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:50:44,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:50:44,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:50:44,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330984347] [2022-01-17 23:50:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:50:44,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:50:44,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:50:44,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:50:44,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:50:44,430 INFO L87 Difference]: Start difference. First operand 128821 states and 397704 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:51:01,378 INFO L93 Difference]: Finished difference Result 231411 states and 713980 transitions. [2022-01-17 23:51:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-01-17 23:51:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-17 23:51:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:51:02,021 INFO L225 Difference]: With dead ends: 231411 [2022-01-17 23:51:02,021 INFO L226 Difference]: Without dead ends: 231411 [2022-01-17 23:51:02,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=4135, Invalid=10627, Unknown=0, NotChecked=0, Total=14762 [2022-01-17 23:51:02,022 INFO L933 BasicCegarLoop]: 2352 mSDtfsCounter, 3282 mSDsluCounter, 19412 mSDsCounter, 0 mSdLazyCounter, 8556 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3282 SdHoareTripleChecker+Valid, 21764 SdHoareTripleChecker+Invalid, 8646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 8556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:02,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3282 Valid, 21764 Invalid, 8646 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [90 Valid, 8556 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-01-17 23:51:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231411 states. [2022-01-17 23:51:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231411 to 145664. [2022-01-17 23:51:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145664 states, 145660 states have (on average 3.091631195935741) internal successors, (450327), 145663 states have internal predecessors, (450327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145664 states to 145664 states and 450327 transitions. [2022-01-17 23:51:07,138 INFO L78 Accepts]: Start accepts. Automaton has 145664 states and 450327 transitions. Word has length 105 [2022-01-17 23:51:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:51:07,138 INFO L470 AbstractCegarLoop]: Abstraction has 145664 states and 450327 transitions. [2022-01-17 23:51:07,138 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-01-17 23:51:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 145664 states and 450327 transitions. [2022-01-17 23:51:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:51:07,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:51:07,371 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-01-17 23:51:07,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-17 23:51:07,372 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-01-17 23:51:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:51:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash -610967297, now seen corresponding path program 33 times [2022-01-17 23:51:07,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:51:07,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261423718] [2022-01-17 23:51:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:51:07,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:51:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:51:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:51:08,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:51:08,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261423718] [2022-01-17 23:51:08,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261423718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:51:08,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:51:08,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:51:08,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692031246] [2022-01-17 23:51:08,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:51:08,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:51:08,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:51:08,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:51:08,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:51:08,323 INFO L87 Difference]: Start difference. First operand 145664 states and 450327 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-01-17 23:51:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:51:27,671 INFO L93 Difference]: Finished difference Result 243253 states and 751668 transitions. [2022-01-17 23:51:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-01-17 23:51:27,671 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-01-17 23:51:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:51:28,772 INFO L225 Difference]: With dead ends: 243253 [2022-01-17 23:51:28,772 INFO L226 Difference]: Without dead ends: 243253 [2022-01-17 23:51:28,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=4325, Invalid=11425, Unknown=0, NotChecked=0, Total=15750 [2022-01-17 23:51:28,774 INFO L933 BasicCegarLoop]: 2402 mSDtfsCounter, 3328 mSDsluCounter, 21551 mSDsCounter, 0 mSdLazyCounter, 9646 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3328 SdHoareTripleChecker+Valid, 23953 SdHoareTripleChecker+Invalid, 9739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 9646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:28,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3328 Valid, 23953 Invalid, 9739 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [93 Valid, 9646 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-01-17 23:51:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243253 states. [2022-01-17 23:51:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243253 to 145726. [2022-01-17 23:51:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145726 states, 145722 states have (on average 3.091605934587777) internal successors, (450515), 145725 states have internal predecessors, (450515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145726 states to 145726 states and 450515 transitions. [2022-01-17 23:51:32,590 INFO L78 Accepts]: Start accepts. Automaton has 145726 states and 450515 transitions. Word has length 105 [2022-01-17 23:51:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:51:32,590 INFO L470 AbstractCegarLoop]: Abstraction has 145726 states and 450515 transitions. [2022-01-17 23:51:32,590 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-01-17 23:51:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 145726 states and 450515 transitions. [2022-01-17 23:51:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:51:32,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:51:32,737 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-01-17 23:51:32,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-17 23:51:32,738 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-01-17 23:51:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:51:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1308604067, now seen corresponding path program 34 times [2022-01-17 23:51:32,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:51:32,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385299396] [2022-01-17 23:51:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:51:32,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:51:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:51:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:51:33,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:51:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385299396] [2022-01-17 23:51:33,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385299396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:51:33,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:51:33,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-17 23:51:33,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679880529] [2022-01-17 23:51:33,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:51:33,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-17 23:51:33,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:51:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-17 23:51:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-01-17 23:51:33,398 INFO L87 Difference]: Start difference. First operand 145726 states and 450515 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-01-17 23:51:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:51:52,808 INFO L93 Difference]: Finished difference Result 236309 states and 730612 transitions. [2022-01-17 23:51:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-01-17 23:51:52,808 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-01-17 23:51:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:51:53,484 INFO L225 Difference]: With dead ends: 236309 [2022-01-17 23:51:53,484 INFO L226 Difference]: Without dead ends: 236309 [2022-01-17 23:51:53,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=4454, Invalid=11802, Unknown=0, NotChecked=0, Total=16256 [2022-01-17 23:51:53,485 INFO L933 BasicCegarLoop]: 2497 mSDtfsCounter, 3220 mSDsluCounter, 21690 mSDsCounter, 0 mSdLazyCounter, 9742 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3220 SdHoareTripleChecker+Valid, 24187 SdHoareTripleChecker+Invalid, 9834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 9742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-17 23:51:53,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3220 Valid, 24187 Invalid, 9834 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 9742 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-01-17 23:51:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236309 states. [2022-01-17 23:51:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236309 to 146005. [2022-01-17 23:51:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146005 states, 146001 states have (on average 3.0917048513366345) internal successors, (451392), 146004 states have internal predecessors, (451392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:51:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146005 states to 146005 states and 451392 transitions. [2022-01-17 23:51:58,137 INFO L78 Accepts]: Start accepts. Automaton has 146005 states and 451392 transitions. Word has length 105 [2022-01-17 23:51:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:51:58,137 INFO L470 AbstractCegarLoop]: Abstraction has 146005 states and 451392 transitions. [2022-01-17 23:51:58,137 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-01-17 23:51:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 146005 states and 451392 transitions. [2022-01-17 23:51:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:51:58,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:51:58,288 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-01-17 23:51:58,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-17 23:51:58,288 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-01-17 23:51:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:51:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash -371924933, now seen corresponding path program 35 times [2022-01-17 23:51:58,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:51:58,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575961441] [2022-01-17 23:51:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:51:58,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:51:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:51:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:51:59,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:51:59,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575961441] [2022-01-17 23:51:59,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575961441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:51:59,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:51:59,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:51:59,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515538451] [2022-01-17 23:51:59,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:51:59,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:51:59,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:51:59,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:51:59,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:51:59,020 INFO L87 Difference]: Start difference. First operand 146005 states and 451392 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-01-17 23:52:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:52:15,935 INFO L93 Difference]: Finished difference Result 224033 states and 691404 transitions. [2022-01-17 23:52:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-17 23:52:15,935 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-01-17 23:52:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:52:16,531 INFO L225 Difference]: With dead ends: 224033 [2022-01-17 23:52:16,531 INFO L226 Difference]: Without dead ends: 224033 [2022-01-17 23:52:16,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3118 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=4254, Invalid=11748, Unknown=0, NotChecked=0, Total=16002 [2022-01-17 23:52:16,532 INFO L933 BasicCegarLoop]: 2446 mSDtfsCounter, 3190 mSDsluCounter, 17462 mSDsCounter, 0 mSdLazyCounter, 7365 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3190 SdHoareTripleChecker+Valid, 19908 SdHoareTripleChecker+Invalid, 7453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 7365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:52:16,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3190 Valid, 19908 Invalid, 7453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 7365 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-01-17 23:52:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224033 states. [2022-01-17 23:52:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224033 to 146966. [2022-01-17 23:52:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146966 states, 146962 states have (on average 3.091316122535077) internal successors, (454306), 146965 states have internal predecessors, (454306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:52:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146966 states to 146966 states and 454306 transitions. [2022-01-17 23:52:21,143 INFO L78 Accepts]: Start accepts. Automaton has 146966 states and 454306 transitions. Word has length 105 [2022-01-17 23:52:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:52:21,143 INFO L470 AbstractCegarLoop]: Abstraction has 146966 states and 454306 transitions. [2022-01-17 23:52:21,143 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-01-17 23:52:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 146966 states and 454306 transitions. [2022-01-17 23:52:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:52:21,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:52:21,329 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-01-17 23:52:21,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-17 23:52:21,329 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-01-17 23:52:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:52:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1588554697, now seen corresponding path program 36 times [2022-01-17 23:52:21,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:52:21,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315320031] [2022-01-17 23:52:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:52:21,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:52:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:52:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:52:21,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:52:21,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315320031] [2022-01-17 23:52:21,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315320031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:52:21,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:52:21,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:52:21,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970685357] [2022-01-17 23:52:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:52:21,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:52:21,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:52:21,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:52:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:52:21,993 INFO L87 Difference]: Start difference. First operand 146966 states and 454306 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-01-17 23:52:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:52:29,768 INFO L93 Difference]: Finished difference Result 176435 states and 543907 transitions. [2022-01-17 23:52:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-17 23:52:29,768 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-01-17 23:52:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:52:30,195 INFO L225 Difference]: With dead ends: 176435 [2022-01-17 23:52:30,196 INFO L226 Difference]: Without dead ends: 176435 [2022-01-17 23:52:30,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-17 23:52:30,196 INFO L933 BasicCegarLoop]: 1047 mSDtfsCounter, 3143 mSDsluCounter, 10689 mSDsCounter, 0 mSdLazyCounter, 4338 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3143 SdHoareTripleChecker+Valid, 11736 SdHoareTripleChecker+Invalid, 4404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 4338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:52:30,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3143 Valid, 11736 Invalid, 4404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 4338 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-17 23:52:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176435 states. [2022-01-17 23:52:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176435 to 147586. [2022-01-17 23:52:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147586 states, 147582 states have (on average 3.0914406905991245) internal successors, (456241), 147585 states have internal predecessors, (456241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:52:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147586 states to 147586 states and 456241 transitions. [2022-01-17 23:52:33,762 INFO L78 Accepts]: Start accepts. Automaton has 147586 states and 456241 transitions. Word has length 105 [2022-01-17 23:52:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:52:33,762 INFO L470 AbstractCegarLoop]: Abstraction has 147586 states and 456241 transitions. [2022-01-17 23:52:33,762 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-01-17 23:52:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 147586 states and 456241 transitions. [2022-01-17 23:52:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:52:34,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:52:34,653 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-01-17 23:52:34,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-17 23:52:34,654 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-01-17 23:52:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:52:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995067, now seen corresponding path program 37 times [2022-01-17 23:52:34,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:52:34,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323921517] [2022-01-17 23:52:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:52:34,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:52:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:52:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:52:35,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:52:35,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323921517] [2022-01-17 23:52:35,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323921517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:52:35,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:52:35,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:52:35,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701759393] [2022-01-17 23:52:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:52:35,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:52:35,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:52:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:52:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:52:35,292 INFO L87 Difference]: Start difference. First operand 147586 states and 456241 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-01-17 23:52:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:52:45,692 INFO L93 Difference]: Finished difference Result 183737 states and 566452 transitions. [2022-01-17 23:52:45,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-17 23:52:45,693 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-01-17 23:52:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:52:46,149 INFO L225 Difference]: With dead ends: 183737 [2022-01-17 23:52:46,150 INFO L226 Difference]: Without dead ends: 183737 [2022-01-17 23:52:46,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-17 23:52:46,150 INFO L933 BasicCegarLoop]: 1332 mSDtfsCounter, 2727 mSDsluCounter, 13555 mSDsCounter, 0 mSdLazyCounter, 5406 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 14887 SdHoareTripleChecker+Invalid, 5471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:52:46,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2727 Valid, 14887 Invalid, 5471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 5406 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-17 23:52:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183737 states. [2022-01-17 23:52:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183737 to 148082. [2022-01-17 23:52:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148082 states, 148078 states have (on average 3.091613879171788) internal successors, (457800), 148081 states have internal predecessors, (457800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:52:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148082 states to 148082 states and 457800 transitions. [2022-01-17 23:52:50,331 INFO L78 Accepts]: Start accepts. Automaton has 148082 states and 457800 transitions. Word has length 105 [2022-01-17 23:52:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:52:50,331 INFO L470 AbstractCegarLoop]: Abstraction has 148082 states and 457800 transitions. [2022-01-17 23:52:50,331 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-01-17 23:52:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 148082 states and 457800 transitions. [2022-01-17 23:52:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-17 23:52:50,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:52:50,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:52:50,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-17 23:52:50,484 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-17 23:52:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:52:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1678675625, now seen corresponding path program 38 times [2022-01-17 23:52:50,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:52:50,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916346105] [2022-01-17 23:52:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:52:50,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:52:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:52:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:52:51,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:52:51,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916346105] [2022-01-17 23:52:51,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916346105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:52:51,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:52:51,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-17 23:52:51,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051815334] [2022-01-17 23:52:51,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:52:51,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-17 23:52:51,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:52:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-17 23:52:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-01-17 23:52:51,263 INFO L87 Difference]: Start difference. First operand 148082 states and 457800 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) Received shutdown request... [2022-01-17 23:52:54,497 WARN L244 SmtUtils]: Removed 13 from assertion stack [2022-01-17 23:52:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-17 23:52:54,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=711, Invalid=2045, Unknown=0, NotChecked=0, Total=2756 [2022-01-17 23:52:54,498 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1195 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-17 23:52:54,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1195 Valid, 2863 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-17 23:52:54,499 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-01-17 23:52:54,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-17 23:52:54,499 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (148082states) and FLOYD_HOARE automaton (currently 28 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 37ms.. [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-01-17 23:52:54,500 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-01-17 23:52:54,501 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-01-17 23:52:54,503 INFO L732 BasicCegarLoop]: Path program histogram: [38, 3, 1] [2022-01-17 23:52:54,505 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-17 23:52:54,505 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-17 23:52:54,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.01 11:52:54 BasicIcfg [2022-01-17 23:52:54,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-17 23:52:54,507 INFO L158 Benchmark]: Toolchain (without parser) took 652905.24ms. Allocated memory was 369.1MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 313.7MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2022-01-17 23:52:54,507 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory is still 331.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 23:52:54,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.85ms. Allocated memory was 369.1MB in the beginning and 453.0MB in the end (delta: 83.9MB). Free memory was 313.5MB in the beginning and 403.8MB in the end (delta: -90.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. [2022-01-17 23:52:54,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.47ms. Allocated memory is still 453.0MB. Free memory was 403.8MB in the beginning and 401.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 23:52:54,508 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 453.0MB. Free memory was 401.7MB in the beginning and 399.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 23:52:54,508 INFO L158 Benchmark]: RCFGBuilder took 506.25ms. Allocated memory is still 453.0MB. Free memory was 399.6MB in the beginning and 378.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-17 23:52:54,508 INFO L158 Benchmark]: TraceAbstraction took 651672.08ms. Allocated memory was 453.0MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 378.6MB in the beginning and 10.4GB in the end (delta: -10.0GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2022-01-17 23:52:54,509 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.12ms. Allocated memory is still 369.1MB. Free memory is still 331.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 639.85ms. Allocated memory was 369.1MB in the beginning and 453.0MB in the end (delta: 83.9MB). Free memory was 313.5MB in the beginning and 403.8MB in the end (delta: -90.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.47ms. Allocated memory is still 453.0MB. Free memory was 403.8MB in the beginning and 401.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 453.0MB. Free memory was 401.7MB in the beginning and 399.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 506.25ms. Allocated memory is still 453.0MB. Free memory was 399.6MB in the beginning and 378.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 651672.08ms. Allocated memory was 453.0MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 378.6MB in the beginning and 10.4GB in the end (delta: -10.0GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics [2022-01-17 23:52:54,516 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end 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 (148082states) and FLOYD_HOARE automaton (currently 28 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 37ms.. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (148082states) and FLOYD_HOARE automaton (currently 28 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 37ms.. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (148082states) and FLOYD_HOARE automaton (currently 28 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 37ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (148082states) and FLOYD_HOARE automaton (currently 28 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 37ms.. - 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 (148082states) and FLOYD_HOARE automaton (currently 28 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 37ms.. - 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 (148082states) and FLOYD_HOARE automaton (currently 28 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 37ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 318 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 651.4s, OverallIterations: 42, TraceHistogramMax: 1, PathProgramHistogramMax: 38, EmptinessCheckTime: 10.8s, AutomataDifference: 438.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119436 SdHoareTripleChecker+Valid, 90.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119436 mSDsluCounter, 531850 SdHoareTripleChecker+Invalid, 75.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479748 mSDsCounter, 3353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199791 IncrementalHoareTripleChecker+Invalid, 203144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3353 mSolverCounterUnsat, 52102 mSDtfsCounter, 199791 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3465 GetRequests, 141 SyntacticMatches, 9 SemanticMatches, 3314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46636 ImplicationChecksByTransitivity, 288.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172417occurred in iteration=31, InterpolantAutomatonStates: 2371, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 167.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 2345959 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 4337 NumberOfCodeBlocks, 4337 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4295 ConstructedInterpolants, 0 QuantifiedInterpolants, 66605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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