/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-Separate.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-18 09:47:38,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 09:47:38,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 09:47:38,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 09:47:38,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 09:47:38,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 09:47:38,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 09:47:38,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 09:47:38,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 09:47:38,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 09:47:38,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 09:47:38,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 09:47:38,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 09:47:38,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 09:47:38,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 09:47:38,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 09:47:38,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 09:47:38,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 09:47:38,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 09:47:38,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 09:47:38,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 09:47:38,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 09:47:38,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 09:47:38,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 09:47:38,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 09:47:38,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 09:47:38,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 09:47:38,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 09:47:38,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 09:47:38,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 09:47:38,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 09:47:38,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 09:47:38,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 09:47:38,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 09:47:38,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 09:47:38,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 09:47:38,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 09:47:38,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 09:47:38,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 09:47:38,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 09:47:38,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 09:47:38,440 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-Separate.epf [2022-01-18 09:47:38,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 09:47:38,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 09:47:38,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 09:47:38,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 09:47:38,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 09:47:38,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 09:47:38,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 09:47:38,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 09:47:38,455 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 09:47:38,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 09:47:38,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 09:47:38,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 09:47:38,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 09:47:38,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 09:47:38,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 09:47:38,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 09:47:38,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 09:47:38,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 09:47:38,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 09:47:38,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 09:47:38,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 09:47:38,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 09:47:38,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 09:47:38,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:47:38,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 09:47:38,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 09:47:38,459 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 09:47:38,459 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-18 09:47:38,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 09:47:38,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 09:47:38,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 09:47:38,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 09:47:38,621 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 09:47:38,622 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-18 09:47:38,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94eabab57/ee46e7a2c8d7462997a4f78ccff458fb/FLAGb6d5f9fb5 [2022-01-18 09:47:39,109 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 09:47:39,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-01-18 09:47:39,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94eabab57/ee46e7a2c8d7462997a4f78ccff458fb/FLAGb6d5f9fb5 [2022-01-18 09:47:39,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94eabab57/ee46e7a2c8d7462997a4f78ccff458fb [2022-01-18 09:47:39,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 09:47:39,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 09:47:39,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 09:47:39,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 09:47:39,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 09:47:39,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7671a79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39, skipping insertion in model container [2022-01-18 09:47:39,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 09:47:39,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 09:47:39,340 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 09:47:39,516 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-18 09:47:39,519 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-18 09:47:39,520 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-18 09:47:39,572 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-18 09:47:39,573 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-18 09:47:39,575 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-18 09:47:39,575 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-18 09:47:39,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:47:39,587 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 09:47:39,599 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 09:47:39,611 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-18 09:47:39,612 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-18 09:47:39,612 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-18 09:47:39,623 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-18 09:47:39,624 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-18 09:47:39,627 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-18 09:47:39,628 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-18 09:47:39,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:47:39,672 INFO L208 MainTranslator]: Completed translation [2022-01-18 09:47:39,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39 WrapperNode [2022-01-18 09:47:39,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 09:47:39,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 09:47:39,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 09:47:39,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 09:47:39,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,720 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2022-01-18 09:47:39,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 09:47:39,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 09:47:39,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 09:47:39,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 09:47:39,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 09:47:39,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 09:47:39,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 09:47:39,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 09:47:39,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (1/1) ... [2022-01-18 09:47:39,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:47:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:47:39,778 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-18 09:47:39,803 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-18 09:47:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-01-18 09:47:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-01-18 09:47:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-01-18 09:47:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-01-18 09:47:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 09:47:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 09:47:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 09:47:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 09:47:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 09:47:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 09:47:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 09:47:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 09:47:39,823 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 09:47:39,948 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 09:47:39,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 09:47:40,183 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 09:47:40,189 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 09:47:40,189 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-18 09:47:40,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:47:40 BoogieIcfgContainer [2022-01-18 09:47:40,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 09:47:40,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 09:47:40,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 09:47:40,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 09:47:40,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 09:47:39" (1/3) ... [2022-01-18 09:47:40,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d7c42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:47:40, skipping insertion in model container [2022-01-18 09:47:40,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:47:39" (2/3) ... [2022-01-18 09:47:40,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d7c42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:47:40, skipping insertion in model container [2022-01-18 09:47:40,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:47:40" (3/3) ... [2022-01-18 09:47:40,195 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-01-18 09:47:40,198 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 09:47:40,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 09:47:40,198 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-18 09:47:40,198 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 09:47:40,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,253 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,253 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,253 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,253 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,253 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,253 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,253 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,254 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,254 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,254 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,254 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,254 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,254 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,254 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,255 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,255 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,255 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,255 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,255 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,255 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,255 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,256 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,256 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,256 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,256 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,256 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,256 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,256 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,259 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,259 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,259 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,259 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,259 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,259 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,259 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-18 09:47:40,259 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-18 09:47:40,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,260 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-18 09:47:40,260 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-18 09:47:40,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,262 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-18 09:47:40,262 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-18 09:47:40,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,262 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-18 09:47:40,262 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-18 09:47:40,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,266 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,266 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,266 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,266 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,267 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,267 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,267 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,267 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,267 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,267 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,267 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-18 09:47:40,267 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-18 09:47:40,268 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,268 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,268 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-18 09:47:40,268 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-18 09:47:40,268 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,268 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,268 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,268 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,269 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,270 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-18 09:47:40,270 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-18 09:47:40,270 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,270 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,270 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-18 09:47:40,270 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-18 09:47:40,270 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,270 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,271 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,272 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,272 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,272 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,272 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,272 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,272 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,273 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,274 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,275 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,275 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,275 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,276 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,276 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,276 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,276 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,276 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,276 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,277 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,277 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,277 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,277 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,277 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,278 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,278 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,278 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,279 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,279 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,279 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,279 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,279 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,279 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,279 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,280 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,280 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,280 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,280 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,280 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,281 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,281 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,281 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,281 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,281 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,281 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,281 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,282 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,283 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,283 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,283 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,283 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,283 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,283 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,283 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,286 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,291 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,292 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,292 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,292 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,292 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,292 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,296 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,296 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,296 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-18 09:47:40,296 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-18 09:47:40,296 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,296 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,296 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,296 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,297 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-18 09:47:40,297 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-18 09:47:40,297 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,297 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,297 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,297 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,297 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,297 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,297 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 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-18 09:47:40,298 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-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,298 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,299 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-18 09:47:40,299 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-18 09:47:40,299 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,299 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,299 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,306 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,306 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,306 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,307 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,307 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,307 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,307 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,308 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,308 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,308 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,308 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,308 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,309 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,309 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,309 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,309 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,309 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,310 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,310 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,310 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,310 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,311 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,311 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,311 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,311 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,312 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,312 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,312 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,312 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,312 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,312 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,313 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,313 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,316 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,317 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,317 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,317 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,317 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,317 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,318 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,319 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,320 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,320 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,320 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,320 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,320 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,321 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,322 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,322 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,331 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-18 09:47:40,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,331 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-18 09:47:40,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,335 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,336 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,337 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,355 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-18 09:47:40,355 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-18 09:47:40,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,357 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,357 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,358 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,359 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,359 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,359 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-18 09:47:40,359 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:47:40,359 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-18 09:47:40,361 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 09:47:40,397 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 09:47:40,401 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-18 09:47:40,401 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-01-18 09:47:40,410 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 210 places, 220 transitions, 456 flow [2022-01-18 09:47:42,426 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-18 09:47:42,574 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-18 09:47:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-18 09:47:42,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:42,733 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-18 09:47:42,734 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-18 09:47:42,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:42,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1408739966, now seen corresponding path program 1 times [2022-01-18 09:47:42,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:42,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585917734] [2022-01-18 09:47:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:42,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:43,312 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-18 09:47:43,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:43,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585917734] [2022-01-18 09:47:43,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585917734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:43,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:43,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 09:47:43,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891196635] [2022-01-18 09:47:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:43,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 09:47:43,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:43,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 09:47:43,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-18 09:47:43,552 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-18 09:47:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:46,025 INFO L93 Difference]: Finished difference Result 101011 states and 310954 transitions. [2022-01-18 09:47:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-18 09:47:46,027 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-18 09:47:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:46,506 INFO L225 Difference]: With dead ends: 101011 [2022-01-18 09:47:46,506 INFO L226 Difference]: Without dead ends: 100951 [2022-01-18 09:47:46,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 09:47:46,509 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1127 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:46,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 4283 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 09:47:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100951 states. [2022-01-18 09:47:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100951 to 95266. [2022-01-18 09:47:49,115 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-18 09:47:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95266 states to 95266 states and 293479 transitions. [2022-01-18 09:47:49,486 INFO L78 Accepts]: Start accepts. Automaton has 95266 states and 293479 transitions. Word has length 83 [2022-01-18 09:47:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:49,486 INFO L470 AbstractCegarLoop]: Abstraction has 95266 states and 293479 transitions. [2022-01-18 09:47:49,487 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-18 09:47:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 95266 states and 293479 transitions. [2022-01-18 09:47:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:47:49,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:49,868 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-18 09:47:49,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 09:47:49,868 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-18 09:47:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash -176902823, now seen corresponding path program 1 times [2022-01-18 09:47:49,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:49,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878384639] [2022-01-18 09:47:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:49,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:50,408 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-18 09:47:50,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878384639] [2022-01-18 09:47:50,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878384639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:50,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:50,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-18 09:47:50,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230073388] [2022-01-18 09:47:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:50,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 09:47:50,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 09:47:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-01-18 09:47:50,410 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-18 09:47:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:47:53,553 INFO L93 Difference]: Finished difference Result 153195 states and 472281 transitions. [2022-01-18 09:47:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-18 09:47:53,554 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-18 09:47:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:47:54,296 INFO L225 Difference]: With dead ends: 153195 [2022-01-18 09:47:54,296 INFO L226 Difference]: Without dead ends: 152229 [2022-01-18 09:47:54,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2022-01-18 09:47:54,297 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2688 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 5405 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:47:54,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2688 Valid, 5405 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-18 09:47:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152229 states. [2022-01-18 09:47:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152229 to 120205. [2022-01-18 09:47:57,203 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-18 09:47:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120205 states to 120205 states and 370986 transitions. [2022-01-18 09:47:57,553 INFO L78 Accepts]: Start accepts. Automaton has 120205 states and 370986 transitions. Word has length 88 [2022-01-18 09:47:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:47:57,555 INFO L470 AbstractCegarLoop]: Abstraction has 120205 states and 370986 transitions. [2022-01-18 09:47:57,555 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-18 09:47:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 120205 states and 370986 transitions. [2022-01-18 09:47:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:47:57,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:47:57,619 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-18 09:47:57,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 09:47:57,619 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-18 09:47:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:47:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 929430313, now seen corresponding path program 2 times [2022-01-18 09:47:57,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:47:57,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419806673] [2022-01-18 09:47:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:47:57,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:47:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:47:58,356 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-18 09:47:58,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:47:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419806673] [2022-01-18 09:47:58,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419806673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:47:58,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:47:58,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-18 09:47:58,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109826246] [2022-01-18 09:47:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:47:58,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 09:47:58,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:47:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 09:47:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-01-18 09:47:58,358 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-18 09:48:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:01,427 INFO L93 Difference]: Finished difference Result 159338 states and 491229 transitions. [2022-01-18 09:48:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-18 09:48:01,428 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-18 09:48:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:01,925 INFO L225 Difference]: With dead ends: 159338 [2022-01-18 09:48:01,925 INFO L226 Difference]: Without dead ends: 159086 [2022-01-18 09:48:01,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2022-01-18 09:48:01,926 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2687 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-18 09:48:01,926 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-18 09:48:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159086 states. [2022-01-18 09:48:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159086 to 118249. [2022-01-18 09:48:04,777 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-18 09:48:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118249 states to 118249 states and 364965 transitions. [2022-01-18 09:48:05,109 INFO L78 Accepts]: Start accepts. Automaton has 118249 states and 364965 transitions. Word has length 88 [2022-01-18 09:48:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:05,110 INFO L470 AbstractCegarLoop]: Abstraction has 118249 states and 364965 transitions. [2022-01-18 09:48:05,110 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-18 09:48:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 118249 states and 364965 transitions. [2022-01-18 09:48:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:48:05,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:05,172 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-18 09:48:05,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 09:48:05,172 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-18 09:48:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1579355583, now seen corresponding path program 3 times [2022-01-18 09:48:05,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:05,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412012636] [2022-01-18 09:48:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:05,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:05,540 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-18 09:48:05,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:05,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412012636] [2022-01-18 09:48:05,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412012636] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:05,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:05,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-18 09:48:05,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337956491] [2022-01-18 09:48:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:05,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 09:48:05,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 09:48:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-01-18 09:48:05,544 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-18 09:48:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:08,682 INFO L93 Difference]: Finished difference Result 131753 states and 405812 transitions. [2022-01-18 09:48:08,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-18 09:48:08,682 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-18 09:48:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:09,062 INFO L225 Difference]: With dead ends: 131753 [2022-01-18 09:48:09,062 INFO L226 Difference]: Without dead ends: 131585 [2022-01-18 09:48:09,063 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-18 09:48:09,064 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-18 09:48:09,064 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-18 09:48:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131585 states. [2022-01-18 09:48:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131585 to 111213. [2022-01-18 09:48:11,289 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-18 09:48:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111213 states to 111213 states and 342827 transitions. [2022-01-18 09:48:11,571 INFO L78 Accepts]: Start accepts. Automaton has 111213 states and 342827 transitions. Word has length 88 [2022-01-18 09:48:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:11,571 INFO L470 AbstractCegarLoop]: Abstraction has 111213 states and 342827 transitions. [2022-01-18 09:48:11,572 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-18 09:48:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 111213 states and 342827 transitions. [2022-01-18 09:48:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:48:11,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:11,664 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-18 09:48:11,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 09:48:11,665 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-18 09:48:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash -903700515, now seen corresponding path program 1 times [2022-01-18 09:48:11,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:11,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857877452] [2022-01-18 09:48:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:11,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:48:12,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:12,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857877452] [2022-01-18 09:48:12,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857877452] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:12,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:12,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:48:12,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852900908] [2022-01-18 09:48:12,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:12,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:48:12,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:12,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:48:12,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:48:12,283 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-18 09:48:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:20,187 INFO L93 Difference]: Finished difference Result 163236 states and 502706 transitions. [2022-01-18 09:48:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-18 09:48:20,187 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-18 09:48:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:20,613 INFO L225 Difference]: With dead ends: 163236 [2022-01-18 09:48:20,613 INFO L226 Difference]: Without dead ends: 163236 [2022-01-18 09:48:20,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-18 09:48:20,615 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.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:48:20,616 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.7s Time] [2022-01-18 09:48:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163236 states. [2022-01-18 09:48:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163236 to 112825. [2022-01-18 09:48:23,095 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-18 09:48:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112825 states to 112825 states and 347770 transitions. [2022-01-18 09:48:23,370 INFO L78 Accepts]: Start accepts. Automaton has 112825 states and 347770 transitions. Word has length 105 [2022-01-18 09:48:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:23,371 INFO L470 AbstractCegarLoop]: Abstraction has 112825 states and 347770 transitions. [2022-01-18 09:48:23,371 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-18 09:48:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 112825 states and 347770 transitions. [2022-01-18 09:48:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:48:23,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:23,855 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-18 09:48:23,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 09:48:23,855 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-18 09:48:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash -535260145, now seen corresponding path program 2 times [2022-01-18 09:48:23,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:23,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821318163] [2022-01-18 09:48:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:23,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:24,633 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-18 09:48:24,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:24,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821318163] [2022-01-18 09:48:24,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821318163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:24,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:24,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:48:24,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318755706] [2022-01-18 09:48:24,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:24,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:48:24,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:24,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:48:24,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:48:24,635 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-18 09:48:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:34,254 INFO L93 Difference]: Finished difference Result 170538 states and 525251 transitions. [2022-01-18 09:48:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 09:48:34,254 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-18 09:48:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:34,930 INFO L225 Difference]: With dead ends: 170538 [2022-01-18 09:48:34,931 INFO L226 Difference]: Without dead ends: 170538 [2022-01-18 09:48:34,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:48:34,932 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-18 09:48:34,933 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-18 09:48:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170538 states. [2022-01-18 09:48:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170538 to 113321. [2022-01-18 09:48:37,479 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-18 09:48:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113321 states to 113321 states and 349329 transitions. [2022-01-18 09:48:37,768 INFO L78 Accepts]: Start accepts. Automaton has 113321 states and 349329 transitions. Word has length 105 [2022-01-18 09:48:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:37,769 INFO L470 AbstractCegarLoop]: Abstraction has 113321 states and 349329 transitions. [2022-01-18 09:48:37,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:48:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 113321 states and 349329 transitions. [2022-01-18 09:48:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:48:37,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:37,866 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-18 09:48:37,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 09:48:37,866 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:48:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash -813579587, now seen corresponding path program 3 times [2022-01-18 09:48:37,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:37,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251053983] [2022-01-18 09:48:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:37,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:38,574 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-18 09:48:38,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251053983] [2022-01-18 09:48:38,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251053983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:38,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:38,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:48:38,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782837142] [2022-01-18 09:48:38,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:38,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:48:38,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:38,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:48:38,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:48:38,575 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-18 09:48:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:48:48,872 INFO L93 Difference]: Finished difference Result 168926 states and 520215 transitions. [2022-01-18 09:48:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 09:48:48,872 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-18 09:48:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:48:49,287 INFO L225 Difference]: With dead ends: 168926 [2022-01-18 09:48:49,287 INFO L226 Difference]: Without dead ends: 168926 [2022-01-18 09:48:49,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-01-18 09:48:49,289 INFO L933 BasicCegarLoop]: 1370 mSDtfsCounter, 2676 mSDsluCounter, 11206 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:48:49,289 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.0s Time] [2022-01-18 09:48:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168926 states. [2022-01-18 09:48:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168926 to 121350. [2022-01-18 09:48:52,060 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-18 09:48:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121350 states to 121350 states and 374335 transitions. [2022-01-18 09:48:52,809 INFO L78 Accepts]: Start accepts. Automaton has 121350 states and 374335 transitions. Word has length 105 [2022-01-18 09:48:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:48:52,809 INFO L470 AbstractCegarLoop]: Abstraction has 121350 states and 374335 transitions. [2022-01-18 09:48:52,809 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-18 09:48:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 121350 states and 374335 transitions. [2022-01-18 09:48:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:48:52,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:48:52,920 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-18 09:48:52,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 09:48:52,920 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-18 09:48:52,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:48:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash -357336867, now seen corresponding path program 4 times [2022-01-18 09:48:52,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:48:52,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180305722] [2022-01-18 09:48:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:48:52,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:48:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:48:53,510 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-18 09:48:53,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:48:53,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180305722] [2022-01-18 09:48:53,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180305722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:48:53,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:48:53,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:48:53,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832263692] [2022-01-18 09:48:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:48:53,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:48:53,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:48:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:48:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:48:53,512 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-18 09:49:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:00,752 INFO L93 Difference]: Finished difference Result 181721 states and 560556 transitions. [2022-01-18 09:49:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:49:00,752 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-18 09:49:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:01,286 INFO L225 Difference]: With dead ends: 181721 [2022-01-18 09:49:01,287 INFO L226 Difference]: Without dead ends: 181721 [2022-01-18 09:49:01,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 09:49:01,288 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 3305 mSDsluCounter, 9668 mSDsCounter, 0 mSdLazyCounter, 3857 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:01,289 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.6s Time] [2022-01-18 09:49:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181721 states. [2022-01-18 09:49:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181721 to 128356. [2022-01-18 09:49:04,236 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-18 09:49:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128356 states to 128356 states and 396466 transitions. [2022-01-18 09:49:04,978 INFO L78 Accepts]: Start accepts. Automaton has 128356 states and 396466 transitions. Word has length 105 [2022-01-18 09:49:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:04,979 INFO L470 AbstractCegarLoop]: Abstraction has 128356 states and 396466 transitions. [2022-01-18 09:49:04,979 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-18 09:49:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 128356 states and 396466 transitions. [2022-01-18 09:49:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:49:05,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:05,097 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-18 09:49:05,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 09:49:05,098 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-18 09:49:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1485183559, now seen corresponding path program 5 times [2022-01-18 09:49:05,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:05,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118619214] [2022-01-18 09:49:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:05,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:05,707 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-18 09:49:05,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:05,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118619214] [2022-01-18 09:49:05,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118619214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:05,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:05,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:49:05,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036515916] [2022-01-18 09:49:05,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:05,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:49:05,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:05,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:49:05,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:49:05,708 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-18 09:49:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:12,706 INFO L93 Difference]: Finished difference Result 181938 states and 560997 transitions. [2022-01-18 09:49:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:49:12,707 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-18 09:49:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:13,179 INFO L225 Difference]: With dead ends: 181938 [2022-01-18 09:49:13,179 INFO L226 Difference]: Without dead ends: 181938 [2022-01-18 09:49:13,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:49:13,180 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.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:13,180 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.6s Time] [2022-01-18 09:49:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181938 states. [2022-01-18 09:49:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181938 to 129472. [2022-01-18 09:49:16,532 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-18 09:49:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129472 states to 129472 states and 399850 transitions. [2022-01-18 09:49:16,894 INFO L78 Accepts]: Start accepts. Automaton has 129472 states and 399850 transitions. Word has length 105 [2022-01-18 09:49:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:16,895 INFO L470 AbstractCegarLoop]: Abstraction has 129472 states and 399850 transitions. [2022-01-18 09:49:16,895 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-18 09:49:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 129472 states and 399850 transitions. [2022-01-18 09:49:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:49:17,016 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:17,016 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-18 09:49:17,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 09:49:17,016 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-18 09:49:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -635656309, now seen corresponding path program 6 times [2022-01-18 09:49:17,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:17,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065133349] [2022-01-18 09:49:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:17,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:17,656 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-18 09:49:17,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:17,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065133349] [2022-01-18 09:49:17,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065133349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:17,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:17,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:49:17,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329671892] [2022-01-18 09:49:17,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:17,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:49:17,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:17,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:49:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:49:17,658 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-18 09:49:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:28,966 INFO L93 Difference]: Finished difference Result 180054 states and 554885 transitions. [2022-01-18 09:49:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 09:49:28,966 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-18 09:49:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:29,446 INFO L225 Difference]: With dead ends: 180054 [2022-01-18 09:49:29,446 INFO L226 Difference]: Without dead ends: 180054 [2022-01-18 09:49:29,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:49:29,448 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-18 09:49:29,448 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-18 09:49:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180054 states. [2022-01-18 09:49:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180054 to 122838. [2022-01-18 09:49:32,324 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-18 09:49:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122838 states to 122838 states and 379012 transitions. [2022-01-18 09:49:33,042 INFO L78 Accepts]: Start accepts. Automaton has 122838 states and 379012 transitions. Word has length 105 [2022-01-18 09:49:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:33,043 INFO L470 AbstractCegarLoop]: Abstraction has 122838 states and 379012 transitions. [2022-01-18 09:49:33,043 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-18 09:49:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 122838 states and 379012 transitions. [2022-01-18 09:49:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:49:33,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:33,154 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-18 09:49:33,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 09:49:33,154 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-18 09:49:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash -694658595, now seen corresponding path program 7 times [2022-01-18 09:49:33,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:33,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927430233] [2022-01-18 09:49:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:33,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:49:33,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:33,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927430233] [2022-01-18 09:49:33,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927430233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:33,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:33,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:49:33,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400464187] [2022-01-18 09:49:33,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:33,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:49:33,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:49:33,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:49:33,869 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-18 09:49:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:45,424 INFO L93 Difference]: Finished difference Result 170838 states and 526877 transitions. [2022-01-18 09:49:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-18 09:49:45,425 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-18 09:49:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:45,835 INFO L225 Difference]: With dead ends: 170838 [2022-01-18 09:49:45,835 INFO L226 Difference]: Without dead ends: 170838 [2022-01-18 09:49:45,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2748, Invalid=6564, Unknown=0, NotChecked=0, Total=9312 [2022-01-18 09:49:45,837 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3354 mSDsluCounter, 10968 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:45,837 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.1s Time] [2022-01-18 09:49:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170838 states. [2022-01-18 09:49:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170838 to 136959. [2022-01-18 09:49:48,792 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-18 09:49:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136959 states to 136959 states and 422887 transitions. [2022-01-18 09:49:49,655 INFO L78 Accepts]: Start accepts. Automaton has 136959 states and 422887 transitions. Word has length 105 [2022-01-18 09:49:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:49:49,655 INFO L470 AbstractCegarLoop]: Abstraction has 136959 states and 422887 transitions. [2022-01-18 09:49:49,655 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-18 09:49:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 136959 states and 422887 transitions. [2022-01-18 09:49:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:49:49,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:49:49,793 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-18 09:49:49,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 09:49:49,793 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-18 09:49:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:49:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089269, now seen corresponding path program 8 times [2022-01-18 09:49:49,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:49:49,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157495916] [2022-01-18 09:49:49,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:49:49,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:49:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:49:50,385 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-18 09:49:50,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:49:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157495916] [2022-01-18 09:49:50,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157495916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:49:50,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:49:50,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:49:50,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551218066] [2022-01-18 09:49:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:49:50,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:49:50,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:49:50,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:49:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:49:50,386 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-18 09:49:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:49:58,510 INFO L93 Difference]: Finished difference Result 230818 states and 714168 transitions. [2022-01-18 09:49:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:49:58,511 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-18 09:49:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:49:59,228 INFO L225 Difference]: With dead ends: 230818 [2022-01-18 09:49:59,228 INFO L226 Difference]: Without dead ends: 230818 [2022-01-18 09:49:59,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 09:49:59,229 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.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:49:59,229 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.0s Time] [2022-01-18 09:49:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230818 states. [2022-01-18 09:50:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230818 to 152180. [2022-01-18 09:50:03,075 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-18 09:50:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152180 states to 152180 states and 470743 transitions. [2022-01-18 09:50:03,497 INFO L78 Accepts]: Start accepts. Automaton has 152180 states and 470743 transitions. Word has length 105 [2022-01-18 09:50:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:03,498 INFO L470 AbstractCegarLoop]: Abstraction has 152180 states and 470743 transitions. [2022-01-18 09:50:03,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:50:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 152180 states and 470743 transitions. [2022-01-18 09:50:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:50:04,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:04,176 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-18 09:50:04,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 09:50:04,177 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-18 09:50:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash 496431157, now seen corresponding path program 9 times [2022-01-18 09:50:04,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:04,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232883127] [2022-01-18 09:50:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:04,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:04,758 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-18 09:50:04,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:04,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232883127] [2022-01-18 09:50:04,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232883127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:04,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:04,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:50:04,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327497113] [2022-01-18 09:50:04,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:04,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:50:04,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:04,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:50:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:50:04,760 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-18 09:50:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:12,338 INFO L93 Difference]: Finished difference Result 231345 states and 715053 transitions. [2022-01-18 09:50:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:50:12,338 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-18 09:50:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:13,002 INFO L225 Difference]: With dead ends: 231345 [2022-01-18 09:50:13,002 INFO L226 Difference]: Without dead ends: 231345 [2022-01-18 09:50:13,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:50:13,003 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, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:13,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2822 Valid, 11813 Invalid, 4718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4645 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-18 09:50:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231345 states. [2022-01-18 09:50:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231345 to 154412. [2022-01-18 09:50:17,072 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-18 09:50:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154412 states to 154412 states and 477511 transitions. [2022-01-18 09:50:17,483 INFO L78 Accepts]: Start accepts. Automaton has 154412 states and 477511 transitions. Word has length 105 [2022-01-18 09:50:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:17,483 INFO L470 AbstractCegarLoop]: Abstraction has 154412 states and 477511 transitions. [2022-01-18 09:50:17,484 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-18 09:50:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 154412 states and 477511 transitions. [2022-01-18 09:50:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:50:17,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:17,641 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-18 09:50:17,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 09:50:17,641 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-18 09:50:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1624408711, now seen corresponding path program 10 times [2022-01-18 09:50:17,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:17,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723821845] [2022-01-18 09:50:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:17,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:18,851 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-18 09:50:18,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723821845] [2022-01-18 09:50:18,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723821845] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:18,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:18,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:50:18,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710482666] [2022-01-18 09:50:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:18,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:50:18,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:50:18,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:50:18,853 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-18 09:50:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:27,861 INFO L93 Difference]: Finished difference Result 220123 states and 680002 transitions. [2022-01-18 09:50:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:50:27,862 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-18 09:50:27,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:28,542 INFO L225 Difference]: With dead ends: 220123 [2022-01-18 09:50:28,542 INFO L226 Difference]: Without dead ends: 220123 [2022-01-18 09:50:28,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1477, Invalid=3635, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 09:50:28,543 INFO L933 BasicCegarLoop]: 1119 mSDtfsCounter, 2851 mSDsluCounter, 11044 mSDsCounter, 0 mSdLazyCounter, 4739 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:28,543 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.1s Time] [2022-01-18 09:50:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220123 states. [2022-01-18 09:50:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220123 to 149049. [2022-01-18 09:50:32,512 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-18 09:50:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149049 states to 149049 states and 460722 transitions. [2022-01-18 09:50:32,916 INFO L78 Accepts]: Start accepts. Automaton has 149049 states and 460722 transitions. Word has length 105 [2022-01-18 09:50:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:32,917 INFO L470 AbstractCegarLoop]: Abstraction has 149049 states and 460722 transitions. [2022-01-18 09:50:32,917 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-18 09:50:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 149049 states and 460722 transitions. [2022-01-18 09:50:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:50:33,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:33,072 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-18 09:50:33,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 09:50:33,072 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-18 09:50:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1683410997, now seen corresponding path program 11 times [2022-01-18 09:50:33,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:33,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381282170] [2022-01-18 09:50:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:33,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:33,689 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-18 09:50:33,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:33,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381282170] [2022-01-18 09:50:33,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381282170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:33,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:33,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:50:33,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388022292] [2022-01-18 09:50:33,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:33,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:50:33,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:50:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:50:33,691 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-18 09:50:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:46,143 INFO L93 Difference]: Finished difference Result 194929 states and 601772 transitions. [2022-01-18 09:50:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-18 09:50:46,143 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-18 09:50:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:47,053 INFO L225 Difference]: With dead ends: 194929 [2022-01-18 09:50:47,053 INFO L226 Difference]: Without dead ends: 194929 [2022-01-18 09:50:47,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2909, Invalid=6991, Unknown=0, NotChecked=0, Total=9900 [2022-01-18 09:50:47,056 INFO L933 BasicCegarLoop]: 1640 mSDtfsCounter, 2958 mSDsluCounter, 13264 mSDsCounter, 0 mSdLazyCounter, 5325 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:47,056 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.8s Time] [2022-01-18 09:50:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194929 states. [2022-01-18 09:50:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194929 to 136289. [2022-01-18 09:50:50,232 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-18 09:50:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136289 states to 136289 states and 421007 transitions. [2022-01-18 09:50:50,618 INFO L78 Accepts]: Start accepts. Automaton has 136289 states and 421007 transitions. Word has length 105 [2022-01-18 09:50:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:50:50,619 INFO L470 AbstractCegarLoop]: Abstraction has 136289 states and 421007 transitions. [2022-01-18 09:50:50,619 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-18 09:50:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 136289 states and 421007 transitions. [2022-01-18 09:50:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:50:50,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:50:50,767 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-18 09:50:50,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 09:50:50,767 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-18 09:50:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:50:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1090206221, now seen corresponding path program 12 times [2022-01-18 09:50:50,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:50:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678774444] [2022-01-18 09:50:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:50:50,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:50:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:50:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:50:51,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:50:51,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678774444] [2022-01-18 09:50:51,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678774444] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:50:51,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:50:51,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 09:50:51,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363832677] [2022-01-18 09:50:51,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:50:51,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:50:51,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:50:51,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:50:51,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-18 09:50:51,280 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-18 09:50:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:50:56,622 INFO L93 Difference]: Finished difference Result 184032 states and 567783 transitions. [2022-01-18 09:50:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-18 09:50:56,623 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-18 09:50:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:50:57,144 INFO L225 Difference]: With dead ends: 184032 [2022-01-18 09:50:57,144 INFO L226 Difference]: Without dead ends: 184032 [2022-01-18 09:50:57,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-01-18 09:50:57,145 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.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:50:57,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2877 Valid, 8757 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-18 09:50:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184032 states. [2022-01-18 09:51:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184032 to 145961. [2022-01-18 09:51:00,294 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-18 09:51:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145961 states to 145961 states and 451389 transitions. [2022-01-18 09:51:01,185 INFO L78 Accepts]: Start accepts. Automaton has 145961 states and 451389 transitions. Word has length 105 [2022-01-18 09:51:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:01,185 INFO L470 AbstractCegarLoop]: Abstraction has 145961 states and 451389 transitions. [2022-01-18 09:51:01,186 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-18 09:51:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 145961 states and 451389 transitions. [2022-01-18 09:51:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:51:01,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:01,451 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-18 09:51:01,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 09:51:01,452 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-18 09:51:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash 811886779, now seen corresponding path program 13 times [2022-01-18 09:51:01,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:01,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196482360] [2022-01-18 09:51:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:01,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:02,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-18 09:51:02,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:02,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196482360] [2022-01-18 09:51:02,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196482360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:02,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:02,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:51:02,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074522912] [2022-01-18 09:51:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:02,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:51:02,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:51:02,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:51:02,132 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-18 09:51:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:09,510 INFO L93 Difference]: Finished difference Result 191131 states and 590890 transitions. [2022-01-18 09:51:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-18 09:51:09,511 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-18 09:51:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:10,031 INFO L225 Difference]: With dead ends: 191131 [2022-01-18 09:51:10,032 INFO L226 Difference]: Without dead ends: 191131 [2022-01-18 09:51:10,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1211, Invalid=3079, Unknown=0, NotChecked=0, Total=4290 [2022-01-18 09:51:10,033 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.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:10,033 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.6s Time] [2022-01-18 09:51:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191131 states. [2022-01-18 09:51:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191131 to 145651. [2022-01-18 09:51:13,252 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-18 09:51:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145651 states to 145651 states and 450387 transitions. [2022-01-18 09:51:14,153 INFO L78 Accepts]: Start accepts. Automaton has 145651 states and 450387 transitions. Word has length 105 [2022-01-18 09:51:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:14,153 INFO L470 AbstractCegarLoop]: Abstraction has 145651 states and 450387 transitions. [2022-01-18 09:51:14,153 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-18 09:51:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 145651 states and 450387 transitions. [2022-01-18 09:51:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:51:14,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:14,341 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-18 09:51:14,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-18 09:51:14,341 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-18 09:51:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 752884493, now seen corresponding path program 14 times [2022-01-18 09:51:14,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:14,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123000008] [2022-01-18 09:51:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:14,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:15,065 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-18 09:51:15,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:15,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123000008] [2022-01-18 09:51:15,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123000008] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:15,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:15,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:51:15,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549309754] [2022-01-18 09:51:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:15,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:51:15,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:51:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:51:15,066 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-18 09:51:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:28,725 INFO L93 Difference]: Finished difference Result 178201 states and 549843 transitions. [2022-01-18 09:51:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-18 09:51:28,726 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-18 09:51:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:29,248 INFO L225 Difference]: With dead ends: 178201 [2022-01-18 09:51:29,249 INFO L226 Difference]: Without dead ends: 178201 [2022-01-18 09:51:29,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2980, Invalid=7322, Unknown=0, NotChecked=0, Total=10302 [2022-01-18 09:51:29,250 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, 3.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:29,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3086 Valid, 17674 Invalid, 6769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 6668 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-18 09:51:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178201 states. [2022-01-18 09:51:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178201 to 140474. [2022-01-18 09:51:32,292 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-18 09:51:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140474 states to 140474 states and 434162 transitions. [2022-01-18 09:51:33,199 INFO L78 Accepts]: Start accepts. Automaton has 140474 states and 434162 transitions. Word has length 105 [2022-01-18 09:51:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:33,199 INFO L470 AbstractCegarLoop]: Abstraction has 140474 states and 434162 transitions. [2022-01-18 09:51:33,200 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-18 09:51:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 140474 states and 434162 transitions. [2022-01-18 09:51:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:51:33,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:33,351 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-18 09:51:33,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-18 09:51:33,351 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-18 09:51:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -379588419, now seen corresponding path program 15 times [2022-01-18 09:51:33,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:33,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325735338] [2022-01-18 09:51:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:33,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:33,910 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-18 09:51:33,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:33,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325735338] [2022-01-18 09:51:33,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325735338] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:33,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:33,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:51:33,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397002533] [2022-01-18 09:51:33,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:33,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:51:33,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:51:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:51:33,912 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-18 09:51:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:47,225 INFO L93 Difference]: Finished difference Result 164426 states and 506766 transitions. [2022-01-18 09:51:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-18 09:51:47,226 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-18 09:51:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:47,658 INFO L225 Difference]: With dead ends: 164426 [2022-01-18 09:51:47,658 INFO L226 Difference]: Without dead ends: 164426 [2022-01-18 09:51:47,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3081, Invalid=7425, Unknown=0, NotChecked=0, Total=10506 [2022-01-18 09:51:47,659 INFO L933 BasicCegarLoop]: 1740 mSDtfsCounter, 2927 mSDsluCounter, 14182 mSDsCounter, 0 mSdLazyCounter, 5941 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:47,659 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.5s Time] [2022-01-18 09:51:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164426 states. [2022-01-18 09:51:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164426 to 128790. [2022-01-18 09:51:50,398 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-18 09:51:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128790 states to 128790 states and 397610 transitions. [2022-01-18 09:51:50,756 INFO L78 Accepts]: Start accepts. Automaton has 128790 states and 397610 transitions. Word has length 105 [2022-01-18 09:51:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:51:50,757 INFO L470 AbstractCegarLoop]: Abstraction has 128790 states and 397610 transitions. [2022-01-18 09:51:50,757 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-18 09:51:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 128790 states and 397610 transitions. [2022-01-18 09:51:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:51:51,329 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:51:51,330 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-18 09:51:51,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-18 09:51:51,330 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-18 09:51:51,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:51:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1308959803, now seen corresponding path program 16 times [2022-01-18 09:51:51,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:51:51,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339269612] [2022-01-18 09:51:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:51:51,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:51:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:51:51,959 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-18 09:51:51,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:51:51,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339269612] [2022-01-18 09:51:51,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339269612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:51:51,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:51:51,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 09:51:51,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693989028] [2022-01-18 09:51:51,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:51:51,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:51:51,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:51:51,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:51:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-18 09:51:51,960 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-18 09:51:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:51:57,538 INFO L93 Difference]: Finished difference Result 173781 states and 535095 transitions. [2022-01-18 09:51:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-18 09:51:57,538 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-18 09:51:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:51:57,944 INFO L225 Difference]: With dead ends: 173781 [2022-01-18 09:51:57,944 INFO L226 Difference]: Without dead ends: 173781 [2022-01-18 09:51:57,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1097, Invalid=2685, Unknown=0, NotChecked=0, Total=3782 [2022-01-18 09:51:57,944 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 2611 mSDsluCounter, 7615 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:51:57,945 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.5s Time] [2022-01-18 09:51:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173781 states. [2022-01-18 09:52:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173781 to 131239. [2022-01-18 09:52:00,746 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-18 09:52:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131239 states to 131239 states and 405201 transitions. [2022-01-18 09:52:01,976 INFO L78 Accepts]: Start accepts. Automaton has 131239 states and 405201 transitions. Word has length 105 [2022-01-18 09:52:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:01,976 INFO L470 AbstractCegarLoop]: Abstraction has 131239 states and 405201 transitions. [2022-01-18 09:52:01,976 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-18 09:52:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 131239 states and 405201 transitions. [2022-01-18 09:52:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:52:02,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:02,136 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-18 09:52:02,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-18 09:52:02,136 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-18 09:52:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1677400173, now seen corresponding path program 17 times [2022-01-18 09:52:02,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:02,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051265690] [2022-01-18 09:52:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:02,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:03,021 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-18 09:52:03,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:03,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051265690] [2022-01-18 09:52:03,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051265690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:03,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:03,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:52:03,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981525745] [2022-01-18 09:52:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:03,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:52:03,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:52:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:52:03,023 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-18 09:52:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:13,336 INFO L93 Difference]: Finished difference Result 186601 states and 574575 transitions. [2022-01-18 09:52:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 09:52:13,336 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-18 09:52:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:14,127 INFO L225 Difference]: With dead ends: 186601 [2022-01-18 09:52:14,127 INFO L226 Difference]: Without dead ends: 186601 [2022-01-18 09:52:14,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:52:14,128 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-18 09:52:14,128 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-18 09:52:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186601 states. [2022-01-18 09:52:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186601 to 132355. [2022-01-18 09:52:17,096 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-18 09:52:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132355 states to 132355 states and 408695 transitions. [2022-01-18 09:52:17,457 INFO L78 Accepts]: Start accepts. Automaton has 132355 states and 408695 transitions. Word has length 105 [2022-01-18 09:52:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:17,458 INFO L470 AbstractCegarLoop]: Abstraction has 132355 states and 408695 transitions. [2022-01-18 09:52:17,458 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-18 09:52:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 132355 states and 408695 transitions. [2022-01-18 09:52:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:52:17,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:17,585 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-18 09:52:17,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-18 09:52:17,585 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-18 09:52:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1399080731, now seen corresponding path program 18 times [2022-01-18 09:52:17,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:17,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138678363] [2022-01-18 09:52:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:17,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:18,276 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-18 09:52:18,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:18,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138678363] [2022-01-18 09:52:18,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138678363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:18,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:18,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:52:18,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75453835] [2022-01-18 09:52:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:18,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:52:18,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:18,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:52:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:52:18,280 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-18 09:52:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:28,605 INFO L93 Difference]: Finished difference Result 186436 states and 574041 transitions. [2022-01-18 09:52:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 09:52:28,605 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-18 09:52:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:29,078 INFO L225 Difference]: With dead ends: 186436 [2022-01-18 09:52:29,078 INFO L226 Difference]: Without dead ends: 186436 [2022-01-18 09:52:29,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-01-18 09:52:29,079 INFO L933 BasicCegarLoop]: 1374 mSDtfsCounter, 2409 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 5180 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:52:29,079 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.1s Time] [2022-01-18 09:52:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186436 states. [2022-01-18 09:52:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186436 to 141355. [2022-01-18 09:52:32,166 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-18 09:52:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141355 states to 141355 states and 436687 transitions. [2022-01-18 09:52:32,543 INFO L78 Accepts]: Start accepts. Automaton has 141355 states and 436687 transitions. Word has length 105 [2022-01-18 09:52:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:32,543 INFO L470 AbstractCegarLoop]: Abstraction has 141355 states and 436687 transitions. [2022-01-18 09:52:32,543 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-18 09:52:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 141355 states and 436687 transitions. [2022-01-18 09:52:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:52:33,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:33,201 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-18 09:52:33,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-18 09:52:33,201 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-18 09:52:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1855323451, now seen corresponding path program 19 times [2022-01-18 09:52:33,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:33,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874623760] [2022-01-18 09:52:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:33,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:33,862 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-18 09:52:33,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:33,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874623760] [2022-01-18 09:52:33,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874623760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:33,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:33,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:52:33,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015617349] [2022-01-18 09:52:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:33,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:52:33,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:52:33,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:52:33,863 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-18 09:52:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:41,112 INFO L93 Difference]: Finished difference Result 197081 states and 607845 transitions. [2022-01-18 09:52:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:52:41,113 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-18 09:52:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:41,674 INFO L225 Difference]: With dead ends: 197081 [2022-01-18 09:52:41,674 INFO L226 Difference]: Without dead ends: 197081 [2022-01-18 09:52:41,674 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-18 09:52:41,674 INFO L933 BasicCegarLoop]: 816 mSDtfsCounter, 3144 mSDsluCounter, 9309 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:52:41,675 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.6s Time] [2022-01-18 09:52:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197081 states. [2022-01-18 09:52:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197081 to 148361. [2022-01-18 09:52:44,916 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-18 09:52:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148361 states to 148361 states and 458818 transitions. [2022-01-18 09:52:45,316 INFO L78 Accepts]: Start accepts. Automaton has 148361 states and 458818 transitions. Word has length 105 [2022-01-18 09:52:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:45,316 INFO L470 AbstractCegarLoop]: Abstraction has 148361 states and 458818 transitions. [2022-01-18 09:52:45,316 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-18 09:52:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 148361 states and 458818 transitions. [2022-01-18 09:52:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:52:45,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:45,462 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-18 09:52:45,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-18 09:52:45,462 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-18 09:52:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash -597123419, now seen corresponding path program 20 times [2022-01-18 09:52:45,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:45,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727053736] [2022-01-18 09:52:45,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:45,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:46,503 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-18 09:52:46,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:46,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727053736] [2022-01-18 09:52:46,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727053736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:46,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:46,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:52:46,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318377648] [2022-01-18 09:52:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:46,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:52:46,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:46,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:52:46,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:52:46,505 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-18 09:52:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:52:53,685 INFO L93 Difference]: Finished difference Result 197298 states and 608286 transitions. [2022-01-18 09:52:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:52:53,689 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-18 09:52:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:52:54,472 INFO L225 Difference]: With dead ends: 197298 [2022-01-18 09:52:54,472 INFO L226 Difference]: Without dead ends: 197298 [2022-01-18 09:52:54,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:52:54,473 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-18 09:52:54,473 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-18 09:52:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197298 states. [2022-01-18 09:52:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197298 to 149477. [2022-01-18 09:52:57,744 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-18 09:52:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149477 states to 149477 states and 462202 transitions. [2022-01-18 09:52:58,157 INFO L78 Accepts]: Start accepts. Automaton has 149477 states and 462202 transitions. Word has length 105 [2022-01-18 09:52:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:52:58,157 INFO L470 AbstractCegarLoop]: Abstraction has 149477 states and 462202 transitions. [2022-01-18 09:52:58,157 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-18 09:52:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 149477 states and 462202 transitions. [2022-01-18 09:52:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:52:58,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:52:58,325 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-18 09:52:58,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-18 09:52:58,325 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-18 09:52:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:52:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1577004009, now seen corresponding path program 21 times [2022-01-18 09:52:58,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:52:58,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092630019] [2022-01-18 09:52:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:52:58,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:52:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:52:59,542 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-18 09:52:59,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:52:59,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092630019] [2022-01-18 09:52:59,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092630019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:52:59,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:52:59,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:52:59,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444109049] [2022-01-18 09:52:59,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:52:59,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:52:59,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:52:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:52:59,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:52:59,543 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-18 09:53:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:10,268 INFO L93 Difference]: Finished difference Result 197853 states and 609629 transitions. [2022-01-18 09:53:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 09:53:10,268 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-18 09:53:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:10,821 INFO L225 Difference]: With dead ends: 197853 [2022-01-18 09:53:10,821 INFO L226 Difference]: Without dead ends: 197853 [2022-01-18 09:53:10,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:53:10,822 INFO L933 BasicCegarLoop]: 1509 mSDtfsCounter, 2803 mSDsluCounter, 12568 mSDsCounter, 0 mSdLazyCounter, 5012 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:53:10,822 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.1s Time] [2022-01-18 09:53:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197853 states. [2022-01-18 09:53:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197853 to 143556. [2022-01-18 09:53:14,407 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-18 09:53:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143556 states to 143556 states and 443636 transitions. [2022-01-18 09:53:14,817 INFO L78 Accepts]: Start accepts. Automaton has 143556 states and 443636 transitions. Word has length 105 [2022-01-18 09:53:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:14,817 INFO L470 AbstractCegarLoop]: Abstraction has 143556 states and 443636 transitions. [2022-01-18 09:53:14,818 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-18 09:53:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 143556 states and 443636 transitions. [2022-01-18 09:53:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:53:14,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:14,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:53:14,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-18 09:53:14,973 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-18 09:53:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1518001723, now seen corresponding path program 22 times [2022-01-18 09:53:14,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:14,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586585430] [2022-01-18 09:53:14,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:14,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:15,602 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-18 09:53:15,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:15,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586585430] [2022-01-18 09:53:15,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586585430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:15,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:15,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:53:15,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389673273] [2022-01-18 09:53:15,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:15,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:53:15,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:15,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:53:15,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:53:15,604 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-18 09:53:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:26,462 INFO L93 Difference]: Finished difference Result 189514 states and 583621 transitions. [2022-01-18 09:53:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-18 09:53:26,463 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-18 09:53:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:26,954 INFO L225 Difference]: With dead ends: 189514 [2022-01-18 09:53:26,955 INFO L226 Difference]: Without dead ends: 189514 [2022-01-18 09:53:26,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2387, Invalid=5623, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:53:26,955 INFO L933 BasicCegarLoop]: 1538 mSDtfsCounter, 2664 mSDsluCounter, 12653 mSDsCounter, 0 mSdLazyCounter, 5105 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:53:26,955 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.6s Time] [2022-01-18 09:53:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189514 states. [2022-01-18 09:53:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189514 to 142533. [2022-01-18 09:53:30,249 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-18 09:53:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142533 states to 142533 states and 440424 transitions. [2022-01-18 09:53:31,164 INFO L78 Accepts]: Start accepts. Automaton has 142533 states and 440424 transitions. Word has length 105 [2022-01-18 09:53:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:31,164 INFO L470 AbstractCegarLoop]: Abstraction has 142533 states and 440424 transitions. [2022-01-18 09:53:31,164 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-18 09:53:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 142533 states and 440424 transitions. [2022-01-18 09:53:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:53:31,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:31,412 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-18 09:53:31,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-18 09:53:31,413 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-18 09:53:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 866571049, now seen corresponding path program 23 times [2022-01-18 09:53:31,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:31,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288759164] [2022-01-18 09:53:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:31,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:31,990 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-18 09:53:31,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288759164] [2022-01-18 09:53:31,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288759164] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:31,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:31,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:53:31,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616323200] [2022-01-18 09:53:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:31,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:53:31,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:53:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:53:31,991 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-18 09:53:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:39,677 INFO L93 Difference]: Finished difference Result 232790 states and 719209 transitions. [2022-01-18 09:53:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:53:39,678 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-18 09:53:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:40,423 INFO L225 Difference]: With dead ends: 232790 [2022-01-18 09:53:40,424 INFO L226 Difference]: Without dead ends: 232790 [2022-01-18 09:53:40,424 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-18 09:53:40,424 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-18 09:53:40,425 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-18 09:53:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232790 states. [2022-01-18 09:53:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232790 to 153073. [2022-01-18 09:53:44,156 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-18 09:53:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153073 states to 153073 states and 473559 transitions. [2022-01-18 09:53:45,024 INFO L78 Accepts]: Start accepts. Automaton has 153073 states and 473559 transitions. Word has length 105 [2022-01-18 09:53:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:45,025 INFO L470 AbstractCegarLoop]: Abstraction has 153073 states and 473559 transitions. [2022-01-18 09:53:45,025 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-18 09:53:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 153073 states and 473559 transitions. [2022-01-18 09:53:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:53:45,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:45,223 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-18 09:53:45,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-18 09:53:45,224 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-18 09:53:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1585875821, now seen corresponding path program 24 times [2022-01-18 09:53:45,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:45,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2712657] [2022-01-18 09:53:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:45,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:45,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-18 09:53:45,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:45,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2712657] [2022-01-18 09:53:45,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2712657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:45,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:45,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:53:45,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132045761] [2022-01-18 09:53:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:45,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:53:45,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:45,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:53:45,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:53:45,812 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-18 09:53:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:53:53,708 INFO L93 Difference]: Finished difference Result 232325 states and 717241 transitions. [2022-01-18 09:53:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:53:53,709 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-18 09:53:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:53:54,424 INFO L225 Difference]: With dead ends: 232325 [2022-01-18 09:53:54,424 INFO L226 Difference]: Without dead ends: 232325 [2022-01-18 09:53:54,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:53:54,425 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 3124 mSDsluCounter, 10938 mSDsCounter, 0 mSdLazyCounter, 4770 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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-18 09:53:54,425 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-18 09:53:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232325 states. [2022-01-18 09:53:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232325 to 154189. [2022-01-18 09:53:58,499 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-18 09:53:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154189 states to 154189 states and 476943 transitions. [2022-01-18 09:53:58,959 INFO L78 Accepts]: Start accepts. Automaton has 154189 states and 476943 transitions. Word has length 105 [2022-01-18 09:53:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:53:58,960 INFO L470 AbstractCegarLoop]: Abstraction has 154189 states and 476943 transitions. [2022-01-18 09:53:58,960 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-18 09:53:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 154189 states and 476943 transitions. [2022-01-18 09:53:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:53:59,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:53:59,177 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-18 09:53:59,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-18 09:53:59,177 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-18 09:53:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:53:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash 588251607, now seen corresponding path program 25 times [2022-01-18 09:53:59,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:53:59,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500371724] [2022-01-18 09:53:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:53:59,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:53:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:53:59,811 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-18 09:53:59,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:53:59,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500371724] [2022-01-18 09:53:59,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500371724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:53:59,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:53:59,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:53:59,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946709031] [2022-01-18 09:53:59,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:53:59,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:53:59,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:53:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:53:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:53:59,812 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-18 09:54:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:09,410 INFO L93 Difference]: Finished difference Result 226135 states and 697862 transitions. [2022-01-18 09:54:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:54:09,411 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-18 09:54:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:10,128 INFO L225 Difference]: With dead ends: 226135 [2022-01-18 09:54:10,128 INFO L226 Difference]: Without dead ends: 226135 [2022-01-18 09:54:10,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1480, Invalid=3632, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 09:54:10,129 INFO L933 BasicCegarLoop]: 1131 mSDtfsCounter, 2615 mSDsluCounter, 10522 mSDsCounter, 0 mSdLazyCounter, 4628 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:10,129 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.5s Time] [2022-01-18 09:54:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226135 states. [2022-01-18 09:54:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226135 to 160854. [2022-01-18 09:54:13,795 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-18 09:54:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160854 states to 160854 states and 497680 transitions. [2022-01-18 09:54:14,772 INFO L78 Accepts]: Start accepts. Automaton has 160854 states and 497680 transitions. Word has length 105 [2022-01-18 09:54:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:14,772 INFO L470 AbstractCegarLoop]: Abstraction has 160854 states and 497680 transitions. [2022-01-18 09:54:14,772 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-18 09:54:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 160854 states and 497680 transitions. [2022-01-18 09:54:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:54:14,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:14,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-18 09:54:14,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-18 09:54:14,981 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-18 09:54:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:14,981 INFO L85 PathProgramCache]: Analyzing trace with hash 529249321, now seen corresponding path program 26 times [2022-01-18 09:54:14,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:14,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350412015] [2022-01-18 09:54:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:14,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:15,627 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-18 09:54:15,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:15,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350412015] [2022-01-18 09:54:15,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350412015] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:15,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:15,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:54:15,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425944167] [2022-01-18 09:54:15,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:15,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:54:15,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:15,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:54:15,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:54:15,629 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-18 09:54:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:28,391 INFO L93 Difference]: Finished difference Result 225624 states and 696169 transitions. [2022-01-18 09:54:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-18 09:54:28,391 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-18 09:54:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:29,118 INFO L225 Difference]: With dead ends: 225624 [2022-01-18 09:54:29,118 INFO L226 Difference]: Without dead ends: 225624 [2022-01-18 09:54:29,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2575, Invalid=6167, Unknown=0, NotChecked=0, Total=8742 [2022-01-18 09:54:29,119 INFO L933 BasicCegarLoop]: 1628 mSDtfsCounter, 2822 mSDsluCounter, 14594 mSDsCounter, 0 mSdLazyCounter, 6103 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:29,119 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.7s Time] [2022-01-18 09:54:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225624 states. [2022-01-18 09:54:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225624 to 159459. [2022-01-18 09:54:33,047 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-18 09:54:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159459 states to 159459 states and 493460 transitions. [2022-01-18 09:54:33,484 INFO L78 Accepts]: Start accepts. Automaton has 159459 states and 493460 transitions. Word has length 105 [2022-01-18 09:54:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:33,485 INFO L470 AbstractCegarLoop]: Abstraction has 159459 states and 493460 transitions. [2022-01-18 09:54:33,485 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-18 09:54:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 159459 states and 493460 transitions. [2022-01-18 09:54:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:54:33,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:33,693 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-18 09:54:33,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-18 09:54:33,694 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-18 09:54:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash -992100757, now seen corresponding path program 27 times [2022-01-18 09:54:33,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:33,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215169893] [2022-01-18 09:54:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:33,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:34,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-18 09:54:34,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:34,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215169893] [2022-01-18 09:54:34,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215169893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:34,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:34,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:54:34,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988944095] [2022-01-18 09:54:34,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:34,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:54:34,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:34,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:54:34,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:54:34,817 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-18 09:54:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:42,815 INFO L93 Difference]: Finished difference Result 257941 states and 799431 transitions. [2022-01-18 09:54:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:54:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-18 09:54:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:43,661 INFO L225 Difference]: With dead ends: 257941 [2022-01-18 09:54:43,661 INFO L226 Difference]: Without dead ends: 257941 [2022-01-18 09:54:43,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 09:54:43,662 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 3329 mSDsluCounter, 10818 mSDsCounter, 0 mSdLazyCounter, 4934 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:43,662 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.0s Time] [2022-01-18 09:54:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257941 states. [2022-01-18 09:54:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257941 to 172417. [2022-01-18 09:54:48,175 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-18 09:54:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172417 states to 172417 states and 535201 transitions. [2022-01-18 09:54:48,689 INFO L78 Accepts]: Start accepts. Automaton has 172417 states and 535201 transitions. Word has length 105 [2022-01-18 09:54:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:54:48,689 INFO L470 AbstractCegarLoop]: Abstraction has 172417 states and 535201 transitions. [2022-01-18 09:54:48,689 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-18 09:54:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 172417 states and 535201 transitions. [2022-01-18 09:54:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:54:48,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:54:48,920 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-18 09:54:48,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-18 09:54:48,921 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-18 09:54:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:54:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 850419669, now seen corresponding path program 28 times [2022-01-18 09:54:48,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:54:48,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112135720] [2022-01-18 09:54:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:54:48,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:54:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:54:49,497 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-18 09:54:49,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:54:49,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112135720] [2022-01-18 09:54:49,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112135720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:54:49,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:54:49,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:54:49,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589537287] [2022-01-18 09:54:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:54:49,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:54:49,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:54:49,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:54:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:54:49,498 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-18 09:54:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:54:57,675 INFO L93 Difference]: Finished difference Result 244363 states and 756027 transitions. [2022-01-18 09:54:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:54:57,676 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-18 09:54:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:54:58,772 INFO L225 Difference]: With dead ends: 244363 [2022-01-18 09:54:58,773 INFO L226 Difference]: Without dead ends: 244363 [2022-01-18 09:54:58,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:54:58,773 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, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:54:58,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3042 Valid, 11580 Invalid, 4781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4703 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-18 09:54:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244363 states. [2022-01-18 09:55:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244363 to 163024. [2022-01-18 09:55:02,359 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-18 09:55:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163024 states to 163024 states and 504735 transitions. [2022-01-18 09:55:03,316 INFO L78 Accepts]: Start accepts. Automaton has 163024 states and 504735 transitions. Word has length 105 [2022-01-18 09:55:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:03,317 INFO L470 AbstractCegarLoop]: Abstraction has 163024 states and 504735 transitions. [2022-01-18 09:55:03,317 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-18 09:55:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 163024 states and 504735 transitions. [2022-01-18 09:55:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:55:03,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:03,594 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-18 09:55:03,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-18 09:55:03,594 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-18 09:55:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1270420199, now seen corresponding path program 29 times [2022-01-18 09:55:03,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:03,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871769346] [2022-01-18 09:55:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:03,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:04,272 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-18 09:55:04,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:04,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871769346] [2022-01-18 09:55:04,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871769346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:04,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:04,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:55:04,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834149504] [2022-01-18 09:55:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:04,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:55:04,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:55:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:55:04,273 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-18 09:55:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:55:12,040 INFO L93 Difference]: Finished difference Result 228987 states and 707760 transitions. [2022-01-18 09:55:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-18 09:55:12,040 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-18 09:55:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:55:12,706 INFO L225 Difference]: With dead ends: 228987 [2022-01-18 09:55:12,706 INFO L226 Difference]: Without dead ends: 228987 [2022-01-18 09:55:12,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-01-18 09:55:12,707 INFO L933 BasicCegarLoop]: 1006 mSDtfsCounter, 2894 mSDsluCounter, 8962 mSDsCounter, 0 mSdLazyCounter, 3966 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:55:12,707 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.8s Time] [2022-01-18 09:55:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228987 states. [2022-01-18 09:55:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228987 to 164729. [2022-01-18 09:55:16,694 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-18 09:55:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164729 states to 164729 states and 510060 transitions. [2022-01-18 09:55:17,160 INFO L78 Accepts]: Start accepts. Automaton has 164729 states and 510060 transitions. Word has length 105 [2022-01-18 09:55:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:17,160 INFO L470 AbstractCegarLoop]: Abstraction has 164729 states and 510060 transitions. [2022-01-18 09:55:17,160 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-18 09:55:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 164729 states and 510060 transitions. [2022-01-18 09:55:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:55:17,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:17,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-18 09:55:17,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-18 09:55:17,371 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-18 09:55:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1329422485, now seen corresponding path program 30 times [2022-01-18 09:55:17,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:17,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78922056] [2022-01-18 09:55:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:17,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:17,931 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-18 09:55:17,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:17,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78922056] [2022-01-18 09:55:17,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78922056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:17,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:17,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:55:17,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292532355] [2022-01-18 09:55:17,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:17,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:55:17,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:17,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:55:17,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:55:17,932 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-18 09:55:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:55:30,037 INFO L93 Difference]: Finished difference Result 217109 states and 669918 transitions. [2022-01-18 09:55:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-18 09:55:30,037 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-18 09:55:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:55:30,616 INFO L225 Difference]: With dead ends: 217109 [2022-01-18 09:55:30,616 INFO L226 Difference]: Without dead ends: 217109 [2022-01-18 09:55:30,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2594, Invalid=6148, Unknown=0, NotChecked=0, Total=8742 [2022-01-18 09:55:30,617 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 2982 mSDsluCounter, 13372 mSDsCounter, 0 mSdLazyCounter, 5716 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:55:30,617 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.6s Time] [2022-01-18 09:55:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217109 states. [2022-01-18 09:55:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217109 to 136726. [2022-01-18 09:55:34,294 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-18 09:55:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136726 states to 136726 states and 422499 transitions. [2022-01-18 09:55:34,665 INFO L78 Accepts]: Start accepts. Automaton has 136726 states and 422499 transitions. Word has length 105 [2022-01-18 09:55:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:34,666 INFO L470 AbstractCegarLoop]: Abstraction has 136726 states and 422499 transitions. [2022-01-18 09:55:34,666 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-18 09:55:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 136726 states and 422499 transitions. [2022-01-18 09:55:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:55:34,805 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:34,805 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-18 09:55:34,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-18 09:55:34,805 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-18 09:55:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1833071899, now seen corresponding path program 31 times [2022-01-18 09:55:34,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:34,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637852326] [2022-01-18 09:55:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:34,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:35,361 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-18 09:55:35,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:35,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637852326] [2022-01-18 09:55:35,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637852326] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:35,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:35,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:55:35,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823012497] [2022-01-18 09:55:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:35,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:55:35,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:55:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:55:35,362 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-18 09:55:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:55:50,181 INFO L93 Difference]: Finished difference Result 225893 states and 695481 transitions. [2022-01-18 09:55:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-01-18 09:55:50,181 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-18 09:55:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:55:50,862 INFO L225 Difference]: With dead ends: 225893 [2022-01-18 09:55:50,862 INFO L226 Difference]: Without dead ends: 225893 [2022-01-18 09:55:50,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3961, Invalid=10319, Unknown=0, NotChecked=0, Total=14280 [2022-01-18 09:55:50,863 INFO L933 BasicCegarLoop]: 1901 mSDtfsCounter, 3624 mSDsluCounter, 12705 mSDsCounter, 0 mSdLazyCounter, 5260 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:55:50,863 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.4s Time] [2022-01-18 09:55:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225893 states. [2022-01-18 09:55:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225893 to 128821. [2022-01-18 09:55:54,289 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-18 09:55:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128821 states to 128821 states and 397704 transitions. [2022-01-18 09:55:54,662 INFO L78 Accepts]: Start accepts. Automaton has 128821 states and 397704 transitions. Word has length 105 [2022-01-18 09:55:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:55:54,662 INFO L470 AbstractCegarLoop]: Abstraction has 128821 states and 397704 transitions. [2022-01-18 09:55:54,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:55:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 128821 states and 397704 transitions. [2022-01-18 09:55:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:55:55,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:55:55,275 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-18 09:55:55,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-18 09:55:55,275 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-18 09:55:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:55:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1635135007, now seen corresponding path program 32 times [2022-01-18 09:55:55,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:55:55,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704302826] [2022-01-18 09:55:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:55:55,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:55:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:55:55,971 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-18 09:55:55,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:55:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704302826] [2022-01-18 09:55:55,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704302826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:55:55,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:55:55,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:55:55,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459864637] [2022-01-18 09:55:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:55:55,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:55:55,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:55:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:55:55,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:55:55,972 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-18 09:56:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:56:12,255 INFO L93 Difference]: Finished difference Result 231411 states and 713980 transitions. [2022-01-18 09:56:12,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-01-18 09:56:12,255 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-18 09:56:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:56:12,892 INFO L225 Difference]: With dead ends: 231411 [2022-01-18 09:56:12,892 INFO L226 Difference]: Without dead ends: 231411 [2022-01-18 09:56:12,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=4135, Invalid=10627, Unknown=0, NotChecked=0, Total=14762 [2022-01-18 09:56:12,893 INFO L933 BasicCegarLoop]: 2352 mSDtfsCounter, 3282 mSDsluCounter, 19412 mSDsCounter, 0 mSdLazyCounter, 8556 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:56:12,893 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.8s Time] [2022-01-18 09:56:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231411 states. [2022-01-18 09:56:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231411 to 145664. [2022-01-18 09:56:16,557 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-18 09:56:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145664 states to 145664 states and 450327 transitions. [2022-01-18 09:56:16,996 INFO L78 Accepts]: Start accepts. Automaton has 145664 states and 450327 transitions. Word has length 105 [2022-01-18 09:56:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:56:16,997 INFO L470 AbstractCegarLoop]: Abstraction has 145664 states and 450327 transitions. [2022-01-18 09:56:16,997 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-18 09:56:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 145664 states and 450327 transitions. [2022-01-18 09:56:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:56:17,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:56:17,970 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-18 09:56:17,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-18 09:56:17,971 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-18 09:56:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:56:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 382514239, now seen corresponding path program 33 times [2022-01-18 09:56:17,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:56:17,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273674313] [2022-01-18 09:56:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:56:17,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:56:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:56:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:56:18,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:56:18,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273674313] [2022-01-18 09:56:18,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273674313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:56:18,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:56:18,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:56:18,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116454320] [2022-01-18 09:56:18,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:56:18,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:56:18,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:56:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:56:18,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:56:18,687 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-18 09:56:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:56:36,929 INFO L93 Difference]: Finished difference Result 243253 states and 751668 transitions. [2022-01-18 09:56:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-01-18 09:56:36,929 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-18 09:56:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:56:37,684 INFO L225 Difference]: With dead ends: 243253 [2022-01-18 09:56:37,685 INFO L226 Difference]: Without dead ends: 243253 [2022-01-18 09:56:37,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=4325, Invalid=11425, Unknown=0, NotChecked=0, Total=15750 [2022-01-18 09:56:37,686 INFO L933 BasicCegarLoop]: 2402 mSDtfsCounter, 3328 mSDsluCounter, 21551 mSDsCounter, 0 mSdLazyCounter, 9646 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:56:37,686 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.1s Time] [2022-01-18 09:56:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243253 states. [2022-01-18 09:56:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243253 to 145726. [2022-01-18 09:56:41,610 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-18 09:56:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145726 states to 145726 states and 450515 transitions. [2022-01-18 09:56:42,015 INFO L78 Accepts]: Start accepts. Automaton has 145726 states and 450515 transitions. Word has length 105 [2022-01-18 09:56:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:56:42,015 INFO L470 AbstractCegarLoop]: Abstraction has 145726 states and 450515 transitions. [2022-01-18 09:56:42,015 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-18 09:56:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 145726 states and 450515 transitions. [2022-01-18 09:56:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:56:42,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:56:42,182 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-18 09:56:42,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-18 09:56:42,182 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-18 09:56:42,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:56:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1308604067, now seen corresponding path program 34 times [2022-01-18 09:56:42,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:56:42,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588678136] [2022-01-18 09:56:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:56:42,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:56:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:56:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:56:42,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:56:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588678136] [2022-01-18 09:56:42,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588678136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:56:42,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:56:42,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 09:56:42,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283479999] [2022-01-18 09:56:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:56:42,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:56:42,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:56:42,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:56:42,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-01-18 09:56:42,723 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-18 09:57:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:01,426 INFO L93 Difference]: Finished difference Result 236309 states and 730612 transitions. [2022-01-18 09:57:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-01-18 09:57:01,426 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-18 09:57:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:02,145 INFO L225 Difference]: With dead ends: 236309 [2022-01-18 09:57:02,146 INFO L226 Difference]: Without dead ends: 236309 [2022-01-18 09:57:02,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=4454, Invalid=11802, Unknown=0, NotChecked=0, Total=16256 [2022-01-18 09:57:02,147 INFO L933 BasicCegarLoop]: 2497 mSDtfsCounter, 3220 mSDsluCounter, 21690 mSDsCounter, 0 mSdLazyCounter, 9742 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:57:02,147 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.5s Time] [2022-01-18 09:57:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236309 states. [2022-01-18 09:57:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236309 to 146005. [2022-01-18 09:57:05,685 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-18 09:57:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146005 states to 146005 states and 451392 transitions. [2022-01-18 09:57:06,594 INFO L78 Accepts]: Start accepts. Automaton has 146005 states and 451392 transitions. Word has length 105 [2022-01-18 09:57:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:06,594 INFO L470 AbstractCegarLoop]: Abstraction has 146005 states and 451392 transitions. [2022-01-18 09:57:06,594 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-18 09:57:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 146005 states and 451392 transitions. [2022-01-18 09:57:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:57:06,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:06,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:57:06,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-18 09:57:06,749 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-18 09:57:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash -371924933, now seen corresponding path program 35 times [2022-01-18 09:57:06,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:06,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664833903] [2022-01-18 09:57:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:06,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:07,379 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-18 09:57:07,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:07,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664833903] [2022-01-18 09:57:07,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664833903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:07,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:07,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:57:07,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591038700] [2022-01-18 09:57:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:07,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:57:07,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:07,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:57:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:57:07,381 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-18 09:57:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:23,904 INFO L93 Difference]: Finished difference Result 224033 states and 691404 transitions. [2022-01-18 09:57:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-18 09:57:23,904 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-18 09:57:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:24,529 INFO L225 Difference]: With dead ends: 224033 [2022-01-18 09:57:24,530 INFO L226 Difference]: Without dead ends: 224033 [2022-01-18 09:57:24,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3118 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=4254, Invalid=11748, Unknown=0, NotChecked=0, Total=16002 [2022-01-18 09:57:24,531 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.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 7365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:57:24,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3190 Valid, 19908 Invalid, 7453 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 7365 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-01-18 09:57:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224033 states. [2022-01-18 09:57:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224033 to 146966. [2022-01-18 09:57:27,984 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-18 09:57:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146966 states to 146966 states and 454306 transitions. [2022-01-18 09:57:28,917 INFO L78 Accepts]: Start accepts. Automaton has 146966 states and 454306 transitions. Word has length 105 [2022-01-18 09:57:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:28,917 INFO L470 AbstractCegarLoop]: Abstraction has 146966 states and 454306 transitions. [2022-01-18 09:57:28,917 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-18 09:57:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 146966 states and 454306 transitions. [2022-01-18 09:57:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:57:29,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:29,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-18 09:57:29,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-18 09:57:29,088 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-18 09:57:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1588554697, now seen corresponding path program 36 times [2022-01-18 09:57:29,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:29,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953031161] [2022-01-18 09:57:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:29,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:29,636 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-18 09:57:29,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:29,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953031161] [2022-01-18 09:57:29,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953031161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:29,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:29,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:57:29,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257494762] [2022-01-18 09:57:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:29,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:57:29,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:57:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:57:29,638 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-18 09:57:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:37,408 INFO L93 Difference]: Finished difference Result 176435 states and 543907 transitions. [2022-01-18 09:57:37,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-18 09:57:37,408 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-18 09:57:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:37,873 INFO L225 Difference]: With dead ends: 176435 [2022-01-18 09:57:37,873 INFO L226 Difference]: Without dead ends: 176435 [2022-01-18 09:57:37,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-01-18 09:57:37,873 INFO L933 BasicCegarLoop]: 1047 mSDtfsCounter, 3143 mSDsluCounter, 10689 mSDsCounter, 0 mSdLazyCounter, 4338 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:57:37,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3143 Valid, 11736 Invalid, 4404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 4338 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-18 09:57:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176435 states. [2022-01-18 09:57:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176435 to 147586. [2022-01-18 09:57:41,024 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-18 09:57:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147586 states to 147586 states and 456241 transitions. [2022-01-18 09:57:41,434 INFO L78 Accepts]: Start accepts. Automaton has 147586 states and 456241 transitions. Word has length 105 [2022-01-18 09:57:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:41,435 INFO L470 AbstractCegarLoop]: Abstraction has 147586 states and 456241 transitions. [2022-01-18 09:57:41,435 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-18 09:57:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 147586 states and 456241 transitions. [2022-01-18 09:57:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:57:42,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:42,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:57:42,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-18 09:57:42,146 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-18 09:57:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995067, now seen corresponding path program 37 times [2022-01-18 09:57:42,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829348738] [2022-01-18 09:57:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:42,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:57:42,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:42,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829348738] [2022-01-18 09:57:42,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829348738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:42,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:42,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:57:42,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443993747] [2022-01-18 09:57:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:42,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:57:42,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:42,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:57:42,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:57:42,782 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-18 09:57:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:57:52,783 INFO L93 Difference]: Finished difference Result 183737 states and 566452 transitions. [2022-01-18 09:57:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 09:57:52,783 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-18 09:57:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:57:53,298 INFO L225 Difference]: With dead ends: 183737 [2022-01-18 09:57:53,298 INFO L226 Difference]: Without dead ends: 183737 [2022-01-18 09:57:53,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:57:53,299 INFO L933 BasicCegarLoop]: 1332 mSDtfsCounter, 2727 mSDsluCounter, 13555 mSDsCounter, 0 mSdLazyCounter, 5406 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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-18 09:57:53,299 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-18 09:57:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183737 states. [2022-01-18 09:57:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183737 to 148082. [2022-01-18 09:57:56,516 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-18 09:57:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148082 states to 148082 states and 457800 transitions. [2022-01-18 09:57:57,399 INFO L78 Accepts]: Start accepts. Automaton has 148082 states and 457800 transitions. Word has length 105 [2022-01-18 09:57:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:57:57,399 INFO L470 AbstractCegarLoop]: Abstraction has 148082 states and 457800 transitions. [2022-01-18 09:57:57,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:57:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 148082 states and 457800 transitions. [2022-01-18 09:57:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:57:57,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:57:57,583 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-18 09:57:57,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-18 09:57:57,583 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-18 09:57:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:57:57,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1678675625, now seen corresponding path program 38 times [2022-01-18 09:57:57,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:57:57,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616875855] [2022-01-18 09:57:57,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:57:57,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:57:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:57:58,311 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-18 09:57:58,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:57:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616875855] [2022-01-18 09:57:58,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616875855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:57:58,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:57:58,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:57:58,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64433064] [2022-01-18 09:57:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:57:58,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:57:58,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:57:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:57:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:57:58,313 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) [2022-01-18 09:58:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:58:08,631 INFO L93 Difference]: Finished difference Result 182125 states and 561416 transitions. [2022-01-18 09:58:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 09:58:08,631 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-18 09:58:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:58:09,352 INFO L225 Difference]: With dead ends: 182125 [2022-01-18 09:58:09,353 INFO L226 Difference]: Without dead ends: 182125 [2022-01-18 09:58:09,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2094, Invalid=5046, Unknown=0, NotChecked=0, Total=7140 [2022-01-18 09:58:09,353 INFO L933 BasicCegarLoop]: 1379 mSDtfsCounter, 2769 mSDsluCounter, 10474 mSDsCounter, 0 mSdLazyCounter, 4271 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2769 SdHoareTripleChecker+Valid, 11853 SdHoareTripleChecker+Invalid, 4360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 4271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:58:09,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2769 Valid, 11853 Invalid, 4360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 4271 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-18 09:58:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182125 states. [2022-01-18 09:58:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182125 to 154499. [2022-01-18 09:58:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154499 states, 154495 states have (on average 3.0934204990452767) internal successors, (477918), 154498 states have internal predecessors, (477918), 0 states have call successors, (0), 0 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-18 09:58:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154499 states to 154499 states and 477918 transitions. [2022-01-18 09:58:13,073 INFO L78 Accepts]: Start accepts. Automaton has 154499 states and 477918 transitions. Word has length 105 [2022-01-18 09:58:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:58:13,073 INFO L470 AbstractCegarLoop]: Abstraction has 154499 states and 477918 transitions. [2022-01-18 09:58:13,073 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-18 09:58:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 154499 states and 477918 transitions. [2022-01-18 09:58:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:58:13,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:58:13,268 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-18 09:58:13,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-18 09:58:13,268 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:58:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:58:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2134918345, now seen corresponding path program 39 times [2022-01-18 09:58:13,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:58:13,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220785484] [2022-01-18 09:58:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:58:13,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:58:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:58:13,865 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-18 09:58:13,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:58:13,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220785484] [2022-01-18 09:58:13,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220785484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:58:13,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:58:13,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:58:13,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34286694] [2022-01-18 09:58:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:58:13,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:58:13,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:58:13,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:58:13,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:58:13,867 INFO L87 Difference]: Start difference. First operand 154499 states and 477918 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-18 09:58:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:58:21,570 INFO L93 Difference]: Finished difference Result 193525 states and 597527 transitions. [2022-01-18 09:58:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 09:58:21,570 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-18 09:58:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:58:22,118 INFO L225 Difference]: With dead ends: 193525 [2022-01-18 09:58:22,118 INFO L226 Difference]: Without dead ends: 193525 [2022-01-18 09:58:22,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 09:58:22,119 INFO L933 BasicCegarLoop]: 813 mSDtfsCounter, 3124 mSDsluCounter, 9833 mSDsCounter, 0 mSdLazyCounter, 4049 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3124 SdHoareTripleChecker+Valid, 10646 SdHoareTripleChecker+Invalid, 4130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 4049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:58:22,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3124 Valid, 10646 Invalid, 4130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 4049 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-18 09:58:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193525 states. [2022-01-18 09:58:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193525 to 161505. [2022-01-18 09:58:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161505 states, 161501 states have (on average 3.09625946588566) internal successors, (500049), 161504 states have internal predecessors, (500049), 0 states have call successors, (0), 0 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-18 09:58:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161505 states to 161505 states and 500049 transitions. [2022-01-18 09:58:26,324 INFO L78 Accepts]: Start accepts. Automaton has 161505 states and 500049 transitions. Word has length 105 [2022-01-18 09:58:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:58:26,324 INFO L470 AbstractCegarLoop]: Abstraction has 161505 states and 500049 transitions. [2022-01-18 09:58:26,324 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-18 09:58:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 161505 states and 500049 transitions. [2022-01-18 09:58:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:58:26,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:58:26,535 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-18 09:58:26,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-18 09:58:26,535 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:58:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:58:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash -317528525, now seen corresponding path program 40 times [2022-01-18 09:58:26,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:58:26,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340474870] [2022-01-18 09:58:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:58:26,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:58:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:58:27,062 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-18 09:58:27,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:58:27,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340474870] [2022-01-18 09:58:27,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340474870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:58:27,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:58:27,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:58:27,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042023901] [2022-01-18 09:58:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:58:27,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:58:27,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:58:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:58:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:58:27,064 INFO L87 Difference]: Start difference. First operand 161505 states and 500049 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-18 09:58:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:58:34,678 INFO L93 Difference]: Finished difference Result 193742 states and 597968 transitions. [2022-01-18 09:58:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-18 09:58:34,679 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-18 09:58:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:58:35,298 INFO L225 Difference]: With dead ends: 193742 [2022-01-18 09:58:35,298 INFO L226 Difference]: Without dead ends: 193742 [2022-01-18 09:58:35,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-01-18 09:58:35,300 INFO L933 BasicCegarLoop]: 955 mSDtfsCounter, 3132 mSDsluCounter, 9600 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3132 SdHoareTripleChecker+Valid, 10555 SdHoareTripleChecker+Invalid, 4042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:58:35,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3132 Valid, 10555 Invalid, 4042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-18 09:58:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193742 states. [2022-01-18 09:58:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193742 to 162621. [2022-01-18 09:58:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162621 states, 162617 states have (on average 3.0958202401962893) internal successors, (503433), 162620 states have internal predecessors, (503433), 0 states have call successors, (0), 0 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-18 09:58:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162621 states to 162621 states and 503433 transitions. [2022-01-18 09:58:39,846 INFO L78 Accepts]: Start accepts. Automaton has 162621 states and 503433 transitions. Word has length 105 [2022-01-18 09:58:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:58:39,846 INFO L470 AbstractCegarLoop]: Abstraction has 162621 states and 503433 transitions. [2022-01-18 09:58:39,846 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-18 09:58:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 162621 states and 503433 transitions. [2022-01-18 09:58:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:58:40,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:58:40,084 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-18 09:58:40,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-18 09:58:40,085 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:58:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:58:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1856598903, now seen corresponding path program 41 times [2022-01-18 09:58:40,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:58:40,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465767554] [2022-01-18 09:58:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:58:40,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:58:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:58:40,721 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-18 09:58:40,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:58:40,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465767554] [2022-01-18 09:58:40,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465767554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:58:40,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:58:40,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:58:40,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675828225] [2022-01-18 09:58:40,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:58:40,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:58:40,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:58:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:58:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:58:40,723 INFO L87 Difference]: Start difference. First operand 162621 states and 503433 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-18 09:58:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:58:52,057 INFO L93 Difference]: Finished difference Result 193253 states and 596086 transitions. [2022-01-18 09:58:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 09:58:52,058 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-18 09:58:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:58:52,613 INFO L225 Difference]: With dead ends: 193253 [2022-01-18 09:58:52,613 INFO L226 Difference]: Without dead ends: 193253 [2022-01-18 09:58:52,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-01-18 09:58:52,614 INFO L933 BasicCegarLoop]: 1514 mSDtfsCounter, 2752 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 5278 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 14793 SdHoareTripleChecker+Invalid, 5367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 5278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:58:52,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2752 Valid, 14793 Invalid, 5367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 5278 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-18 09:58:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193253 states. [2022-01-18 09:58:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193253 to 155987. [2022-01-18 09:58:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155987 states, 155983 states have (on average 3.0938948475154344) internal successors, (482595), 155986 states have internal predecessors, (482595), 0 states have call successors, (0), 0 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-18 09:58:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155987 states to 155987 states and 482595 transitions. [2022-01-18 09:58:57,265 INFO L78 Accepts]: Start accepts. Automaton has 155987 states and 482595 transitions. Word has length 105 [2022-01-18 09:58:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:58:57,265 INFO L470 AbstractCegarLoop]: Abstraction has 155987 states and 482595 transitions. [2022-01-18 09:58:57,265 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-18 09:58:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 155987 states and 482595 transitions. [2022-01-18 09:58:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 09:58:57,600 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:58:57,601 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-18 09:58:57,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-18 09:58:57,601 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-01-18 09:58:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:58:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1797596617, now seen corresponding path program 42 times [2022-01-18 09:58:57,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:58:57,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220315727] [2022-01-18 09:58:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:58:57,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:58:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:58:58,263 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-18 09:58:58,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:58:58,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220315727] [2022-01-18 09:58:58,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220315727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:58:58,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:58:58,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 09:58:58,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385422131] [2022-01-18 09:58:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:58:58,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 09:58:58,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:58:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 09:58:58,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-18 09:58:58,265 INFO L87 Difference]: Start difference. First operand 155987 states and 482595 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-18 09:59:06,572 WARN L244 SmtUtils]: Removed 25 from assertion stack [2022-01-18 09:59:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-18 09:59:06,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2077, Invalid=4729, Unknown=0, NotChecked=0, Total=6806 [2022-01-18 09:59:06,573 INFO L933 BasicCegarLoop]: 792 mSDtfsCounter, 1970 mSDsluCounter, 6529 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1970 SdHoareTripleChecker+Valid, 7321 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:59:06,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1970 Valid, 7321 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-18 09:59:06,573 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-01-18 09:59:06,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-18 09:59:06,574 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (155987states) and FLOYD_HOARE automaton (currently 58 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 45ms.. [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-01-18 09:59:06,575 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-01-18 09:59:06,577 INFO L732 BasicCegarLoop]: Path program histogram: [42, 3, 1] [2022-01-18 09:59:06,579 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 09:59:06,579 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 09:59:06,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 09:59:06 BasicIcfg [2022-01-18 09:59:06,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 09:59:06,581 INFO L158 Benchmark]: Toolchain (without parser) took 687442.38ms. Allocated memory was 367.0MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 311.4MB in the beginning and 13.0GB in the end (delta: -12.7GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2022-01-18 09:59:06,581 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 367.0MB. Free memory is still 329.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 09:59:06,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.80ms. Allocated memory is still 367.0MB. Free memory was 311.2MB in the beginning and 317.6MB in the end (delta: -6.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. [2022-01-18 09:59:06,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.21ms. Allocated memory is still 367.0MB. Free memory was 317.6MB in the beginning and 313.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 09:59:06,581 INFO L158 Benchmark]: Boogie Preprocessor took 31.25ms. Allocated memory is still 367.0MB. Free memory was 313.4MB in the beginning and 312.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 09:59:06,581 INFO L158 Benchmark]: RCFGBuilder took 437.70ms. Allocated memory is still 367.0MB. Free memory was 311.3MB in the beginning and 292.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-18 09:59:06,581 INFO L158 Benchmark]: TraceAbstraction took 686389.28ms. Allocated memory was 367.0MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 291.4MB in the beginning and 13.0GB in the end (delta: -12.7GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2022-01-18 09:59:06,582 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 367.0MB. Free memory is still 329.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 532.80ms. Allocated memory is still 367.0MB. Free memory was 311.2MB in the beginning and 317.6MB in the end (delta: -6.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.21ms. Allocated memory is still 367.0MB. Free memory was 317.6MB in the beginning and 313.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.25ms. Allocated memory is still 367.0MB. Free memory was 313.4MB in the beginning and 312.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 437.70ms. Allocated memory is still 367.0MB. Free memory was 311.3MB in the beginning and 292.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 686389.28ms. Allocated memory was 367.0MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 291.4MB in the beginning and 13.0GB in the end (delta: -12.7GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (155987states) and FLOYD_HOARE automaton (currently 58 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 45ms.. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (155987states) and FLOYD_HOARE automaton (currently 58 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 45ms.. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (155987states) and FLOYD_HOARE automaton (currently 58 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 45ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (155987states) and FLOYD_HOARE automaton (currently 58 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 45ms.. - 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 (155987states) and FLOYD_HOARE automaton (currently 58 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 45ms.. - 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 (155987states) and FLOYD_HOARE automaton (currently 58 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 45ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 318 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 686.2s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 42, EmptinessCheckTime: 11.7s, AutomataDifference: 465.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131988 SdHoareTripleChecker+Valid, 96.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131988 mSDsluCounter, 584155 SdHoareTripleChecker+Invalid, 81.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 526873 mSDsCounter, 3704 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218223 IncrementalHoareTripleChecker+Invalid, 221927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3704 mSolverCounterUnsat, 57282 mSDtfsCounter, 218223 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3818 GetRequests, 154 SyntacticMatches, 9 SemanticMatches, 3654 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50740 ImplicationChecksByTransitivity, 300.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172417occurred in iteration=31, InterpolantAutomatonStates: 2589, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 176.1s AutomataMinimizationTime, 45 MinimizatonAttempts, 2473992 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 4757 NumberOfCodeBlocks, 4757 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4711 ConstructedInterpolants, 0 QuantifiedInterpolants, 73360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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