/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 16:28:48,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 16:28:48,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 16:28:48,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 16:28:48,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 16:28:48,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 16:28:48,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 16:28:48,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 16:28:48,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 16:28:48,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 16:28:48,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 16:28:48,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 16:28:48,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 16:28:48,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 16:28:48,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 16:28:48,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 16:28:48,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 16:28:48,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 16:28:48,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 16:28:48,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 16:28:48,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 16:28:48,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 16:28:48,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 16:28:48,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 16:28:48,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 16:28:48,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 16:28:48,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 16:28:48,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 16:28:48,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 16:28:48,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 16:28:48,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 16:28:48,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 16:28:48,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 16:28:48,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 16:28:48,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 16:28:48,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 16:28:48,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 16:28:48,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 16:28:48,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 16:28:48,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 16:28:48,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 16:28:48,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 16:28:48,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 16:28:48,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 16:28:48,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 16:28:48,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 16:28:48,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 16:28:48,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 16:28:48,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 16:28:48,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 16:28:48,196 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 16:28:48,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 16:28:48,196 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 16:28:48,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 16:28:48,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 16:28:48,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 16:28:48,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 16:28:48,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 16:28:48,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 16:28:48,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 16:28:48,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 16:28:48,197 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 16:28:48,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 16:28:48,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 16:28:48,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 16:28:48,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 16:28:48,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 16:28:48,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:28:48,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 16:28:48,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 16:28:48,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 16:28:48,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 16:28:48,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 16:28:48,199 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 16:28:48,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 16:28:48,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-03 16:28:48,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 16:28:48,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 16:28:48,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 16:28:48,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 16:28:48,396 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 16:28:48,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-03-03 16:28:48,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a182df50/53cea96673914d94ac486b7e4d908646/FLAG12a0a9d05 [2022-03-03 16:28:48,794 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 16:28:48,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-03-03 16:28:48,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a182df50/53cea96673914d94ac486b7e4d908646/FLAG12a0a9d05 [2022-03-03 16:28:49,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a182df50/53cea96673914d94ac486b7e4d908646 [2022-03-03 16:28:49,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 16:28:49,188 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 16:28:49,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 16:28:49,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 16:28:49,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 16:28:49,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb656bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49, skipping insertion in model container [2022-03-03 16:28:49,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 16:28:49,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 16:28:49,359 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-03 16:28:49,524 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_1w1r-2.i[39095,39108] [2022-03-03 16:28:49,528 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_1w1r-2.i[39180,39193] [2022-03-03 16:28:49,528 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_1w1r-2.i[39232,39245] [2022-03-03 16:28:49,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:28:49,541 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 16:28:49,552 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-03 16:28:49,581 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_1w1r-2.i[39095,39108] [2022-03-03 16:28:49,581 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_1w1r-2.i[39180,39193] [2022-03-03 16:28:49,582 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_1w1r-2.i[39232,39245] [2022-03-03 16:28:49,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:28:49,615 INFO L208 MainTranslator]: Completed translation [2022-03-03 16:28:49,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49 WrapperNode [2022-03-03 16:28:49,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 16:28:49,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 16:28:49,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 16:28:49,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 16:28:49,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,663 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2022-03-03 16:28:49,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 16:28:49,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 16:28:49,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 16:28:49,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 16:28:49,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 16:28:49,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 16:28:49,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 16:28:49,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 16:28:49,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (1/1) ... [2022-03-03 16:28:49,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:28:49,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:28:49,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 16:28:49,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 16:28:49,754 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2022-03-03 16:28:49,755 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2022-03-03 16:28:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 16:28:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 16:28:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 16:28:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 16:28:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 16:28:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 16:28:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 16:28:49,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 16:28:49,756 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 16:28:49,850 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 16:28:49,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 16:28:50,021 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 16:28:50,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 16:28:50,027 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 16:28:50,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:28:50 BoogieIcfgContainer [2022-03-03 16:28:50,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 16:28:50,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 16:28:50,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 16:28:50,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 16:28:50,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:28:49" (1/3) ... [2022-03-03 16:28:50,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be0453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:28:50, skipping insertion in model container [2022-03-03 16:28:50,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:28:49" (2/3) ... [2022-03-03 16:28:50,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be0453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:28:50, skipping insertion in model container [2022-03-03 16:28:50,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:28:50" (3/3) ... [2022-03-03 16:28:50,037 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2022-03-03 16:28:50,040 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 16:28:50,040 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 16:28:50,040 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-03-03 16:28:50,041 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 16:28:50,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,087 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,087 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,087 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,087 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,087 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,087 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,087 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,088 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,088 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,088 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,088 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,088 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,088 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,088 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,096 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,097 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,098 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,099 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,101 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,101 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,101 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,102 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,102 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,102 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,102 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,102 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,102 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,102 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,103 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,104 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,107 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,108 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,108 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,108 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,108 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,108 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,108 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,109 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,110 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,110 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,110 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,111 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,111 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,111 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,111 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,111 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,111 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,111 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,112 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,112 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,112 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,112 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,112 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,116 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,116 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,116 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,116 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,116 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,116 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,117 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,121 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,121 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,121 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,121 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,121 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,121 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,121 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,122 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,122 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,122 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,122 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,123 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,124 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:28:50,131 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-03-03 16:28:50,167 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 16:28:50,180 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 16:28:50,181 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-03 16:28:50,191 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 152 places, 158 transitions, 324 flow [2022-03-03 16:28:50,279 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2540 states, 2537 states have (on average 2.127709893575089) internal successors, (5398), 2539 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 2540 states, 2537 states have (on average 2.127709893575089) internal successors, (5398), 2539 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-03 16:28:50,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:28:50,293 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] [2022-03-03 16:28:50,293 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:28:50,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:28:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 847621616, now seen corresponding path program 1 times [2022-03-03 16:28:50,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:28:50,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528363657] [2022-03-03 16:28:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:28:50,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:28:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:28:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:28:50,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:28:50,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528363657] [2022-03-03 16:28:50,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528363657] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:28:50,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:28:50,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 16:28:50,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574513499] [2022-03-03 16:28:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:28:50,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 16:28:50,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:28:50,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 16:28:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 16:28:50,490 INFO L87 Difference]: Start difference. First operand has 2540 states, 2537 states have (on average 2.127709893575089) internal successors, (5398), 2539 states have internal predecessors, (5398), 0 states have call successors, (0), 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 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:28:50,540 INFO L93 Difference]: Finished difference Result 2540 states and 5152 transitions. [2022-03-03 16:28:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 16:28:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-03-03 16:28:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:28:50,565 INFO L225 Difference]: With dead ends: 2540 [2022-03-03 16:28:50,565 INFO L226 Difference]: Without dead ends: 2540 [2022-03-03 16:28:50,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 16:28:50,569 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:28:50,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:28:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2022-03-03 16:28:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2540. [2022-03-03 16:28:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2537 states have (on average 2.030744974379188) internal successors, (5152), 2539 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 5152 transitions. [2022-03-03 16:28:50,690 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 5152 transitions. Word has length 40 [2022-03-03 16:28:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:28:50,690 INFO L470 AbstractCegarLoop]: Abstraction has 2540 states and 5152 transitions. [2022-03-03 16:28:50,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 5152 transitions. [2022-03-03 16:28:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-03 16:28:50,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:28:50,692 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] [2022-03-03 16:28:50,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 16:28:50,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:28:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:28:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash 506434889, now seen corresponding path program 1 times [2022-03-03 16:28:50,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:28:50,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602441687] [2022-03-03 16:28:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:28:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:28:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:28:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:28:50,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:28:50,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602441687] [2022-03-03 16:28:50,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602441687] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:28:50,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:28:50,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 16:28:50,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023307213] [2022-03-03 16:28:50,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:28:50,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 16:28:50,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:28:50,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 16:28:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:28:50,778 INFO L87 Difference]: Start difference. First operand 2540 states and 5152 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:28:50,830 INFO L93 Difference]: Finished difference Result 4136 states and 8424 transitions. [2022-03-03 16:28:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 16:28:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-03-03 16:28:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:28:50,847 INFO L225 Difference]: With dead ends: 4136 [2022-03-03 16:28:50,847 INFO L226 Difference]: Without dead ends: 4136 [2022-03-03 16:28:50,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:28:50,848 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:28:50,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 305 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:28:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2022-03-03 16:28:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 3148. [2022-03-03 16:28:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3145 states have (on average 2.0419713831478536) internal successors, (6422), 3147 states have internal predecessors, (6422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 6422 transitions. [2022-03-03 16:28:50,914 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 6422 transitions. Word has length 41 [2022-03-03 16:28:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:28:50,915 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 6422 transitions. [2022-03-03 16:28:50,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 6422 transitions. [2022-03-03 16:28:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-03 16:28:50,922 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:28:50,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:28:50,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 16:28:50,923 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:28:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:28:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -654644372, now seen corresponding path program 1 times [2022-03-03 16:28:50,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:28:50,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046667535] [2022-03-03 16:28:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:28:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:28:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:28:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:28:51,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:28:51,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046667535] [2022-03-03 16:28:51,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046667535] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:28:51,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:28:51,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-03 16:28:51,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529467688] [2022-03-03 16:28:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:28:51,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 16:28:51,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:28:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 16:28:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-03-03 16:28:51,394 INFO L87 Difference]: Start difference. First operand 3148 states and 6422 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:28:52,909 INFO L93 Difference]: Finished difference Result 3509 states and 7163 transitions. [2022-03-03 16:28:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 16:28:52,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-03-03 16:28:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:28:52,919 INFO L225 Difference]: With dead ends: 3509 [2022-03-03 16:28:52,919 INFO L226 Difference]: Without dead ends: 3353 [2022-03-03 16:28:52,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=361, Invalid=971, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 16:28:52,921 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1166 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:28:52,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 2909 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 16:28:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2022-03-03 16:28:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3088. [2022-03-03 16:28:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 3085 states have (on average 2.045705024311183) internal successors, (6311), 3087 states have internal predecessors, (6311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 6311 transitions. [2022-03-03 16:28:52,982 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 6311 transitions. Word has length 74 [2022-03-03 16:28:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:28:52,982 INFO L470 AbstractCegarLoop]: Abstraction has 3088 states and 6311 transitions. [2022-03-03 16:28:52,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 6311 transitions. [2022-03-03 16:28:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:28:52,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:28:52,986 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] [2022-03-03 16:28:52,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 16:28:52,986 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:28:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:28:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1119085425, now seen corresponding path program 1 times [2022-03-03 16:28:52,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:28:52,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370809954] [2022-03-03 16:28:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:28:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:28:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:28:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:28:53,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:28:53,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370809954] [2022-03-03 16:28:53,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370809954] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:28:53,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:28:53,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:28:53,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119439872] [2022-03-03 16:28:53,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:28:53,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:28:53,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:28:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:28:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:28:53,677 INFO L87 Difference]: Start difference. First operand 3088 states and 6311 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:28:59,710 INFO L93 Difference]: Finished difference Result 4311 states and 8834 transitions. [2022-03-03 16:28:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:28:59,711 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:28:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:28:59,724 INFO L225 Difference]: With dead ends: 4311 [2022-03-03 16:28:59,724 INFO L226 Difference]: Without dead ends: 4311 [2022-03-03 16:28:59,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1453, Invalid=4247, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:28:59,726 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 1239 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:28:59,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1239 Valid, 4379 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 16:28:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2022-03-03 16:28:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 3439. [2022-03-03 16:28:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3436 states have (on average 2.0480209545983703) internal successors, (7037), 3438 states have internal predecessors, (7037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 7037 transitions. [2022-03-03 16:28:59,809 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 7037 transitions. Word has length 96 [2022-03-03 16:28:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:28:59,810 INFO L470 AbstractCegarLoop]: Abstraction has 3439 states and 7037 transitions. [2022-03-03 16:28:59,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:28:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 7037 transitions. [2022-03-03 16:28:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:28:59,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:28:59,815 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] [2022-03-03 16:28:59,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 16:28:59,818 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:28:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:28:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1259521701, now seen corresponding path program 2 times [2022-03-03 16:28:59,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:28:59,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034164819] [2022-03-03 16:28:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:28:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:28:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:00,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:00,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034164819] [2022-03-03 16:29:00,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034164819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:00,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:00,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-03 16:29:00,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521451804] [2022-03-03 16:29:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:00,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-03 16:29:00,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-03 16:29:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-03-03 16:29:00,764 INFO L87 Difference]: Start difference. First operand 3439 states and 7037 transitions. Second operand has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 29 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:07,953 INFO L93 Difference]: Finished difference Result 4308 states and 8822 transitions. [2022-03-03 16:29:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-03 16:29:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 29 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:07,966 INFO L225 Difference]: With dead ends: 4308 [2022-03-03 16:29:07,966 INFO L226 Difference]: Without dead ends: 4308 [2022-03-03 16:29:07,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1594, Invalid=4568, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:29:07,968 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 1324 mSDsluCounter, 5512 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 5880 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:07,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1324 Valid, 5880 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:29:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2022-03-03 16:29:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 3443. [2022-03-03 16:29:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 3440 states have (on average 2.04796511627907) internal successors, (7045), 3442 states have internal predecessors, (7045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 7045 transitions. [2022-03-03 16:29:08,035 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 7045 transitions. Word has length 96 [2022-03-03 16:29:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:08,037 INFO L470 AbstractCegarLoop]: Abstraction has 3443 states and 7045 transitions. [2022-03-03 16:29:08,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 29 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 7045 transitions. [2022-03-03 16:29:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:08,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:08,044 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] [2022-03-03 16:29:08,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 16:29:08,044 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:08,045 INFO L85 PathProgramCache]: Analyzing trace with hash -340043283, now seen corresponding path program 3 times [2022-03-03 16:29:08,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:08,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473157083] [2022-03-03 16:29:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:08,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:08,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473157083] [2022-03-03 16:29:08,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473157083] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:08,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:08,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:08,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379759466] [2022-03-03 16:29:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:08,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:08,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:08,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:08,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:08,641 INFO L87 Difference]: Start difference. First operand 3443 states and 7045 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:14,378 INFO L93 Difference]: Finished difference Result 4303 states and 8811 transitions. [2022-03-03 16:29:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:29:14,379 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:14,391 INFO L225 Difference]: With dead ends: 4303 [2022-03-03 16:29:14,391 INFO L226 Difference]: Without dead ends: 4303 [2022-03-03 16:29:14,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1387, Invalid=3443, Unknown=0, NotChecked=0, Total=4830 [2022-03-03 16:29:14,393 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 1398 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 3747 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:14,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 3747 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 16:29:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2022-03-03 16:29:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3447. [2022-03-03 16:29:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 3444 states have (on average 2.047909407665505) internal successors, (7053), 3446 states have internal predecessors, (7053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 7053 transitions. [2022-03-03 16:29:14,444 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 7053 transitions. Word has length 96 [2022-03-03 16:29:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:14,444 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 7053 transitions. [2022-03-03 16:29:14,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 7053 transitions. [2022-03-03 16:29:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:14,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:14,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:29:14,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 16:29:14,449 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1585435859, now seen corresponding path program 4 times [2022-03-03 16:29:14,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:14,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483120215] [2022-03-03 16:29:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:15,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:15,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483120215] [2022-03-03 16:29:15,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483120215] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:15,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:15,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:15,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342309300] [2022-03-03 16:29:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:15,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:15,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:15,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:15,007 INFO L87 Difference]: Start difference. First operand 3447 states and 7053 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:20,154 INFO L93 Difference]: Finished difference Result 4320 states and 8838 transitions. [2022-03-03 16:29:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:29:20,155 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:20,161 INFO L225 Difference]: With dead ends: 4320 [2022-03-03 16:29:20,161 INFO L226 Difference]: Without dead ends: 4320 [2022-03-03 16:29:20,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1216, Invalid=3614, Unknown=0, NotChecked=0, Total=4830 [2022-03-03 16:29:20,163 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1332 mSDsluCounter, 5139 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 5482 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:20,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1332 Valid, 5482 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 16:29:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2022-03-03 16:29:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 3522. [2022-03-03 16:29:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 3519 states have (on average 2.048025007104291) internal successors, (7207), 3521 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 7207 transitions. [2022-03-03 16:29:20,212 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 7207 transitions. Word has length 96 [2022-03-03 16:29:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:20,212 INFO L470 AbstractCegarLoop]: Abstraction has 3522 states and 7207 transitions. [2022-03-03 16:29:20,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 7207 transitions. [2022-03-03 16:29:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:20,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:20,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:29:20,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 16:29:20,216 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:20,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1790053019, now seen corresponding path program 5 times [2022-03-03 16:29:20,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:20,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062483441] [2022-03-03 16:29:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:20,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:20,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:20,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062483441] [2022-03-03 16:29:20,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062483441] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:20,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:20,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:20,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391080667] [2022-03-03 16:29:20,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:20,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:20,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:20,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:20,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:20,963 INFO L87 Difference]: Start difference. First operand 3522 states and 7207 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:26,316 INFO L93 Difference]: Finished difference Result 4304 states and 8804 transitions. [2022-03-03 16:29:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-03 16:29:26,317 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:26,323 INFO L225 Difference]: With dead ends: 4304 [2022-03-03 16:29:26,323 INFO L226 Difference]: Without dead ends: 4304 [2022-03-03 16:29:26,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1178, Invalid=2982, Unknown=0, NotChecked=0, Total=4160 [2022-03-03 16:29:26,324 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1166 mSDsluCounter, 4175 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 4513 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:26,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 4513 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 16:29:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states. [2022-03-03 16:29:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 3720. [2022-03-03 16:29:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3720 states, 3717 states have (on average 2.0497713209577615) internal successors, (7619), 3719 states have internal predecessors, (7619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 7619 transitions. [2022-03-03 16:29:26,380 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 7619 transitions. Word has length 96 [2022-03-03 16:29:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:26,381 INFO L470 AbstractCegarLoop]: Abstraction has 3720 states and 7619 transitions. [2022-03-03 16:29:26,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 7619 transitions. [2022-03-03 16:29:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:26,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:26,384 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] [2022-03-03 16:29:26,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 16:29:26,384 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:26,385 INFO L85 PathProgramCache]: Analyzing trace with hash -588264749, now seen corresponding path program 6 times [2022-03-03 16:29:26,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:26,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927339657] [2022-03-03 16:29:26,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:26,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:26,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927339657] [2022-03-03 16:29:26,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927339657] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:26,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:26,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:26,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474316614] [2022-03-03 16:29:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:26,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:26,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:26,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:26,963 INFO L87 Difference]: Start difference. First operand 3720 states and 7619 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:32,271 INFO L93 Difference]: Finished difference Result 4381 states and 8960 transitions. [2022-03-03 16:29:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-03 16:29:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:32,277 INFO L225 Difference]: With dead ends: 4381 [2022-03-03 16:29:32,278 INFO L226 Difference]: Without dead ends: 4381 [2022-03-03 16:29:32,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1205, Invalid=3085, Unknown=0, NotChecked=0, Total=4290 [2022-03-03 16:29:32,279 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1246 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:32,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 3958 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 16:29:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2022-03-03 16:29:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 3695. [2022-03-03 16:29:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 3692 states have (on average 2.049024918743229) internal successors, (7565), 3694 states have internal predecessors, (7565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 7565 transitions. [2022-03-03 16:29:32,328 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 7565 transitions. Word has length 96 [2022-03-03 16:29:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:32,328 INFO L470 AbstractCegarLoop]: Abstraction has 3695 states and 7565 transitions. [2022-03-03 16:29:32,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 7565 transitions. [2022-03-03 16:29:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:32,332 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:32,332 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] [2022-03-03 16:29:32,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 16:29:32,332 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 847590765, now seen corresponding path program 7 times [2022-03-03 16:29:32,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:32,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525343543] [2022-03-03 16:29:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:32,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:32,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525343543] [2022-03-03 16:29:32,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525343543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:32,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:32,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-03 16:29:32,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823266471] [2022-03-03 16:29:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:32,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-03 16:29:32,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-03 16:29:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-03-03 16:29:32,831 INFO L87 Difference]: Start difference. First operand 3695 states and 7565 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:42,669 INFO L93 Difference]: Finished difference Result 4377 states and 8954 transitions. [2022-03-03 16:29:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-03 16:29:42,669 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:42,678 INFO L225 Difference]: With dead ends: 4377 [2022-03-03 16:29:42,679 INFO L226 Difference]: Without dead ends: 4377 [2022-03-03 16:29:42,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2938, Invalid=7162, Unknown=0, NotChecked=0, Total=10100 [2022-03-03 16:29:42,681 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1558 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 4378 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:42,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1558 Valid, 4378 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 16:29:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2022-03-03 16:29:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 3525. [2022-03-03 16:29:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3522 states have (on average 2.045428733674049) internal successors, (7204), 3524 states have internal predecessors, (7204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 7204 transitions. [2022-03-03 16:29:42,739 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 7204 transitions. Word has length 96 [2022-03-03 16:29:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:42,739 INFO L470 AbstractCegarLoop]: Abstraction has 3525 states and 7204 transitions. [2022-03-03 16:29:42,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 7204 transitions. [2022-03-03 16:29:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:42,743 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:42,744 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] [2022-03-03 16:29:42,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 16:29:42,744 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1757374095, now seen corresponding path program 8 times [2022-03-03 16:29:42,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:42,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924695444] [2022-03-03 16:29:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:43,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:43,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924695444] [2022-03-03 16:29:43,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924695444] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:43,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:43,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:43,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286512477] [2022-03-03 16:29:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:43,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:43,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:43,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:43,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:43,344 INFO L87 Difference]: Start difference. First operand 3525 states and 7204 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:48,983 INFO L93 Difference]: Finished difference Result 5034 states and 10338 transitions. [2022-03-03 16:29:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:29:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:48,990 INFO L225 Difference]: With dead ends: 5034 [2022-03-03 16:29:48,990 INFO L226 Difference]: Without dead ends: 5034 [2022-03-03 16:29:48,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1452, Invalid=4248, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:29:48,992 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1184 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:48,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1184 Valid, 4471 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 16:29:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2022-03-03 16:29:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 3759. [2022-03-03 16:29:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3756 states have (on average 2.0543130990415337) internal successors, (7716), 3758 states have internal predecessors, (7716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 7716 transitions. [2022-03-03 16:29:49,042 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 7716 transitions. Word has length 96 [2022-03-03 16:29:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:49,042 INFO L470 AbstractCegarLoop]: Abstraction has 3759 states and 7716 transitions. [2022-03-03 16:29:49,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 7716 transitions. [2022-03-03 16:29:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:49,046 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:49,046 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] [2022-03-03 16:29:49,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 16:29:49,046 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1616937819, now seen corresponding path program 9 times [2022-03-03 16:29:49,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:49,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718629024] [2022-03-03 16:29:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:49,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:49,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718629024] [2022-03-03 16:29:49,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718629024] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:49,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:49,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:49,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027465058] [2022-03-03 16:29:49,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:49,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:49,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:49,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:49,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:49,583 INFO L87 Difference]: Start difference. First operand 3759 states and 7716 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:29:55,212 INFO L93 Difference]: Finished difference Result 5031 states and 10326 transitions. [2022-03-03 16:29:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-03 16:29:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:29:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:29:55,218 INFO L225 Difference]: With dead ends: 5031 [2022-03-03 16:29:55,218 INFO L226 Difference]: Without dead ends: 5031 [2022-03-03 16:29:55,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1433, Invalid=4117, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:29:55,220 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1216 mSDsluCounter, 4425 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 4772 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:29:55,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1216 Valid, 4772 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 16:29:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2022-03-03 16:29:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 3763. [2022-03-03 16:29:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3763 states, 3760 states have (on average 2.054255319148936) internal successors, (7724), 3762 states have internal predecessors, (7724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 7724 transitions. [2022-03-03 16:29:55,274 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 7724 transitions. Word has length 96 [2022-03-03 16:29:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:29:55,274 INFO L470 AbstractCegarLoop]: Abstraction has 3763 states and 7724 transitions. [2022-03-03 16:29:55,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:29:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 7724 transitions. [2022-03-03 16:29:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:29:55,278 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:29:55,278 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] [2022-03-03 16:29:55,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-03 16:29:55,278 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:29:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:29:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1758551059, now seen corresponding path program 10 times [2022-03-03 16:29:55,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:29:55,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467579769] [2022-03-03 16:29:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:29:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:29:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:29:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:29:55,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:29:55,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467579769] [2022-03-03 16:29:55,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467579769] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:29:55,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:29:55,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:29:55,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714072659] [2022-03-03 16:29:55,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:29:55,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:29:55,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:29:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:29:55,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:29:55,845 INFO L87 Difference]: Start difference. First operand 3763 states and 7724 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:01,713 INFO L93 Difference]: Finished difference Result 5072 states and 10409 transitions. [2022-03-03 16:30:01,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:30:01,713 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:01,719 INFO L225 Difference]: With dead ends: 5072 [2022-03-03 16:30:01,719 INFO L226 Difference]: Without dead ends: 5072 [2022-03-03 16:30:01,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1386, Invalid=3444, Unknown=0, NotChecked=0, Total=4830 [2022-03-03 16:30:01,721 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 1341 mSDsluCounter, 4918 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:01,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1341 Valid, 5269 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 16:30:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2022-03-03 16:30:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 3794. [2022-03-03 16:30:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3791 states have (on average 2.0543392244790293) internal successors, (7788), 3793 states have internal predecessors, (7788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 7788 transitions. [2022-03-03 16:30:01,765 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 7788 transitions. Word has length 96 [2022-03-03 16:30:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:01,766 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 7788 transitions. [2022-03-03 16:30:01,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 7788 transitions. [2022-03-03 16:30:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:01,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:01,769 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] [2022-03-03 16:30:01,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-03 16:30:01,770 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:01,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash 166928083, now seen corresponding path program 11 times [2022-03-03 16:30:01,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:01,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739341112] [2022-03-03 16:30:01,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:02,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:02,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739341112] [2022-03-03 16:30:02,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739341112] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:02,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:02,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:30:02,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767092117] [2022-03-03 16:30:02,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:02,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:30:02,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:02,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:30:02,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:30:02,303 INFO L87 Difference]: Start difference. First operand 3794 states and 7788 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:07,244 INFO L93 Difference]: Finished difference Result 4966 states and 10183 transitions. [2022-03-03 16:30:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:30:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:07,250 INFO L225 Difference]: With dead ends: 4966 [2022-03-03 16:30:07,250 INFO L226 Difference]: Without dead ends: 4966 [2022-03-03 16:30:07,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1215, Invalid=3615, Unknown=0, NotChecked=0, Total=4830 [2022-03-03 16:30:07,251 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 1262 mSDsluCounter, 4076 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:07,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 4428 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 16:30:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2022-03-03 16:30:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 3846. [2022-03-03 16:30:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3843 states have (on average 2.053343741868332) internal successors, (7891), 3845 states have internal predecessors, (7891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 7891 transitions. [2022-03-03 16:30:07,299 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 7891 transitions. Word has length 96 [2022-03-03 16:30:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:07,300 INFO L470 AbstractCegarLoop]: Abstraction has 3846 states and 7891 transitions. [2022-03-03 16:30:07,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 7891 transitions. [2022-03-03 16:30:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:07,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:07,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:30:07,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-03 16:30:07,308 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1086406501, now seen corresponding path program 12 times [2022-03-03 16:30:07,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:07,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981983624] [2022-03-03 16:30:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:07,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:07,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981983624] [2022-03-03 16:30:07,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981983624] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:07,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:07,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:30:07,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541905665] [2022-03-03 16:30:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:07,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:30:07,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:30:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:30:07,883 INFO L87 Difference]: Start difference. First operand 3846 states and 7891 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:13,242 INFO L93 Difference]: Finished difference Result 4908 states and 10063 transitions. [2022-03-03 16:30:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-03 16:30:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:13,257 INFO L225 Difference]: With dead ends: 4908 [2022-03-03 16:30:13,257 INFO L226 Difference]: Without dead ends: 4908 [2022-03-03 16:30:13,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1179, Invalid=2981, Unknown=0, NotChecked=0, Total=4160 [2022-03-03 16:30:13,257 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1219 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 4641 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:13,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 4641 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 16:30:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2022-03-03 16:30:13,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 3774. [2022-03-03 16:30:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3771 states have (on average 2.049058605144524) internal successors, (7727), 3773 states have internal predecessors, (7727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 7727 transitions. [2022-03-03 16:30:13,302 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 7727 transitions. Word has length 96 [2022-03-03 16:30:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:13,303 INFO L470 AbstractCegarLoop]: Abstraction has 3774 states and 7727 transitions. [2022-03-03 16:30:13,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 7727 transitions. [2022-03-03 16:30:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:13,306 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:13,306 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] [2022-03-03 16:30:13,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-03 16:30:13,306 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2006772525, now seen corresponding path program 13 times [2022-03-03 16:30:13,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:13,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873868226] [2022-03-03 16:30:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:13,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:13,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873868226] [2022-03-03 16:30:13,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873868226] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:13,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:13,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:30:13,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861439543] [2022-03-03 16:30:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:13,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:30:13,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:30:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:30:13,845 INFO L87 Difference]: Start difference. First operand 3774 states and 7727 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:19,094 INFO L93 Difference]: Finished difference Result 4945 states and 10131 transitions. [2022-03-03 16:30:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-03 16:30:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:19,100 INFO L225 Difference]: With dead ends: 4945 [2022-03-03 16:30:19,100 INFO L226 Difference]: Without dead ends: 4945 [2022-03-03 16:30:19,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1204, Invalid=3086, Unknown=0, NotChecked=0, Total=4290 [2022-03-03 16:30:19,101 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1229 mSDsluCounter, 4101 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 4451 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:19,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1229 Valid, 4451 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 16:30:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2022-03-03 16:30:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 3857. [2022-03-03 16:30:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3857 states, 3854 states have (on average 2.048521017125065) internal successors, (7895), 3856 states have internal predecessors, (7895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 7895 transitions. [2022-03-03 16:30:19,150 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 7895 transitions. Word has length 96 [2022-03-03 16:30:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:19,151 INFO L470 AbstractCegarLoop]: Abstraction has 3857 states and 7895 transitions. [2022-03-03 16:30:19,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 7895 transitions. [2022-03-03 16:30:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:19,154 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:19,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] [2022-03-03 16:30:19,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-03 16:30:19,155 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash -570917011, now seen corresponding path program 14 times [2022-03-03 16:30:19,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:19,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763618508] [2022-03-03 16:30:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:19,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:19,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763618508] [2022-03-03 16:30:19,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763618508] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:19,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:19,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-03 16:30:19,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796893424] [2022-03-03 16:30:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:19,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-03 16:30:19,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-03 16:30:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-03-03 16:30:19,671 INFO L87 Difference]: Start difference. First operand 3857 states and 7895 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:31,437 INFO L93 Difference]: Finished difference Result 5371 states and 10998 transitions. [2022-03-03 16:30:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-03 16:30:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:31,442 INFO L225 Difference]: With dead ends: 5371 [2022-03-03 16:30:31,443 INFO L226 Difference]: Without dead ends: 5371 [2022-03-03 16:30:31,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2114 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3739, Invalid=9143, Unknown=0, NotChecked=0, Total=12882 [2022-03-03 16:30:31,444 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 1467 mSDsluCounter, 4491 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 4948 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:31,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1467 Valid, 4948 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 16:30:31,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2022-03-03 16:30:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 3544. [2022-03-03 16:30:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 3541 states have (on average 2.0454673820954534) internal successors, (7243), 3543 states have internal predecessors, (7243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 7243 transitions. [2022-03-03 16:30:31,487 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 7243 transitions. Word has length 96 [2022-03-03 16:30:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:31,487 INFO L470 AbstractCegarLoop]: Abstraction has 3544 states and 7243 transitions. [2022-03-03 16:30:31,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 7243 transitions. [2022-03-03 16:30:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:31,490 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:31,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:30:31,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-03 16:30:31,490 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2037360013, now seen corresponding path program 15 times [2022-03-03 16:30:31,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:31,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418596824] [2022-03-03 16:30:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:32,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:32,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418596824] [2022-03-03 16:30:32,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418596824] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:32,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:32,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:30:32,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504643744] [2022-03-03 16:30:32,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:32,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:30:32,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:30:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:30:32,038 INFO L87 Difference]: Start difference. First operand 3544 states and 7243 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:42,799 INFO L93 Difference]: Finished difference Result 4892 states and 9992 transitions. [2022-03-03 16:30:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-03 16:30:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:42,804 INFO L225 Difference]: With dead ends: 4892 [2022-03-03 16:30:42,805 INFO L226 Difference]: Without dead ends: 4892 [2022-03-03 16:30:42,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1923 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3366, Invalid=8406, Unknown=0, NotChecked=0, Total=11772 [2022-03-03 16:30:42,806 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 1518 mSDsluCounter, 4109 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:42,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1518 Valid, 4491 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 16:30:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2022-03-03 16:30:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4008. [2022-03-03 16:30:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4005 states have (on average 2.0454431960049937) internal successors, (8192), 4007 states have internal predecessors, (8192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 8192 transitions. [2022-03-03 16:30:42,848 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 8192 transitions. Word has length 96 [2022-03-03 16:30:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:42,849 INFO L470 AbstractCegarLoop]: Abstraction has 4008 states and 8192 transitions. [2022-03-03 16:30:42,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 8192 transitions. [2022-03-03 16:30:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:42,852 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:42,852 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] [2022-03-03 16:30:42,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-03 16:30:42,853 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash 155436657, now seen corresponding path program 16 times [2022-03-03 16:30:42,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:42,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446640803] [2022-03-03 16:30:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:43,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-03-03 16:30:43,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:43,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446640803] [2022-03-03 16:30:43,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446640803] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:43,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:43,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:30:43,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861600577] [2022-03-03 16:30:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:43,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:30:43,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:43,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:30:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:30:43,386 INFO L87 Difference]: Start difference. First operand 4008 states and 8192 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:49,148 INFO L93 Difference]: Finished difference Result 5127 states and 10527 transitions. [2022-03-03 16:30:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:30:49,148 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:49,154 INFO L225 Difference]: With dead ends: 5127 [2022-03-03 16:30:49,154 INFO L226 Difference]: Without dead ends: 5127 [2022-03-03 16:30:49,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1451, Invalid=4249, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:30:49,154 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1187 mSDsluCounter, 5026 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 5364 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:49,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1187 Valid, 5364 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 16:30:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2022-03-03 16:30:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4232. [2022-03-03 16:30:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4232 states, 4229 states have (on average 2.0534405296760463) internal successors, (8684), 4231 states have internal predecessors, (8684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 8684 transitions. [2022-03-03 16:30:49,198 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 8684 transitions. Word has length 96 [2022-03-03 16:30:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:49,198 INFO L470 AbstractCegarLoop]: Abstraction has 4232 states and 8684 transitions. [2022-03-03 16:30:49,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 8684 transitions. [2022-03-03 16:30:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:49,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:49,202 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] [2022-03-03 16:30:49,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-03 16:30:49,202 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash 15000381, now seen corresponding path program 17 times [2022-03-03 16:30:49,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:49,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227595636] [2022-03-03 16:30:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:49,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:49,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227595636] [2022-03-03 16:30:49,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227595636] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:49,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:49,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:30:49,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766892694] [2022-03-03 16:30:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:49,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:30:49,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:30:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:30:49,716 INFO L87 Difference]: Start difference. First operand 4232 states and 8684 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:30:55,202 INFO L93 Difference]: Finished difference Result 5124 states and 10515 transitions. [2022-03-03 16:30:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-03 16:30:55,202 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:30:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:30:55,208 INFO L225 Difference]: With dead ends: 5124 [2022-03-03 16:30:55,208 INFO L226 Difference]: Without dead ends: 5124 [2022-03-03 16:30:55,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1432, Invalid=4118, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:30:55,210 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1285 mSDsluCounter, 3913 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:30:55,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1285 Valid, 4253 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 16:30:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2022-03-03 16:30:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 4236. [2022-03-03 16:30:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4236 states, 4233 states have (on average 2.0533900307110797) internal successors, (8692), 4235 states have internal predecessors, (8692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4236 states to 4236 states and 8692 transitions. [2022-03-03 16:30:55,264 INFO L78 Accepts]: Start accepts. Automaton has 4236 states and 8692 transitions. Word has length 96 [2022-03-03 16:30:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:30:55,264 INFO L470 AbstractCegarLoop]: Abstraction has 4236 states and 8692 transitions. [2022-03-03 16:30:55,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:30:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4236 states and 8692 transitions. [2022-03-03 16:30:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:30:55,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:30:55,269 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] [2022-03-03 16:30:55,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-03 16:30:55,269 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:30:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:30:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 934478799, now seen corresponding path program 18 times [2022-03-03 16:30:55,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:30:55,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760344601] [2022-03-03 16:30:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:30:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:30:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:30:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:30:55,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:30:55,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760344601] [2022-03-03 16:30:55,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760344601] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:30:55,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:30:55,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:30:55,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320959894] [2022-03-03 16:30:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:30:55,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:30:55,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:30:55,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:30:55,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:30:55,913 INFO L87 Difference]: Start difference. First operand 4236 states and 8692 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:02,067 INFO L93 Difference]: Finished difference Result 5119 states and 10504 transitions. [2022-03-03 16:31:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:31:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:31:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:02,073 INFO L225 Difference]: With dead ends: 5119 [2022-03-03 16:31:02,073 INFO L226 Difference]: Without dead ends: 5119 [2022-03-03 16:31:02,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1384, Invalid=3446, Unknown=0, NotChecked=0, Total=4830 [2022-03-03 16:31:02,074 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1336 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 2209 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:02,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1336 Valid, 4845 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2209 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 16:31:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2022-03-03 16:31:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4240. [2022-03-03 16:31:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4240 states, 4237 states have (on average 2.0533396270946422) internal successors, (8700), 4239 states have internal predecessors, (8700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 8700 transitions. [2022-03-03 16:31:02,112 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 8700 transitions. Word has length 96 [2022-03-03 16:31:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:02,112 INFO L470 AbstractCegarLoop]: Abstraction has 4240 states and 8700 transitions. [2022-03-03 16:31:02,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 8700 transitions. [2022-03-03 16:31:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:31:02,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:02,117 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] [2022-03-03 16:31:02,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-03 16:31:02,117 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:02,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1435009355, now seen corresponding path program 19 times [2022-03-03 16:31:02,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:02,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500581961] [2022-03-03 16:31:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:02,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:02,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500581961] [2022-03-03 16:31:02,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500581961] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:02,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:02,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:31:02,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259208019] [2022-03-03 16:31:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:02,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:31:02,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:31:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:31:02,597 INFO L87 Difference]: Start difference. First operand 4240 states and 8700 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:07,473 INFO L93 Difference]: Finished difference Result 5036 states and 10324 transitions. [2022-03-03 16:31:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:31:07,473 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:31:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:07,478 INFO L225 Difference]: With dead ends: 5036 [2022-03-03 16:31:07,478 INFO L226 Difference]: Without dead ends: 5036 [2022-03-03 16:31:07,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1214, Invalid=3616, Unknown=0, NotChecked=0, Total=4830 [2022-03-03 16:31:07,479 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1249 mSDsluCounter, 4377 mSDsCounter, 0 mSdLazyCounter, 2041 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 4722 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:07,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1249 Valid, 4722 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2041 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 16:31:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2022-03-03 16:31:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4292. [2022-03-03 16:31:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4292 states, 4289 states have (on average 2.0524597808346936) internal successors, (8803), 4291 states have internal predecessors, (8803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 8803 transitions. [2022-03-03 16:31:07,521 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 8803 transitions. Word has length 96 [2022-03-03 16:31:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:07,521 INFO L470 AbstractCegarLoop]: Abstraction has 4292 states and 8803 transitions. [2022-03-03 16:31:07,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 8803 transitions. [2022-03-03 16:31:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:31:07,525 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:07,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:07,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-03 16:31:07,525 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash -515530937, now seen corresponding path program 20 times [2022-03-03 16:31:07,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:07,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838992450] [2022-03-03 16:31:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:08,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:08,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838992450] [2022-03-03 16:31:08,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838992450] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:08,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:08,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:31:08,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898607519] [2022-03-03 16:31:08,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:08,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:31:08,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:08,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:31:08,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:31:08,154 INFO L87 Difference]: Start difference. First operand 4292 states and 8803 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:13,609 INFO L93 Difference]: Finished difference Result 4974 states and 10196 transitions. [2022-03-03 16:31:13,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-03 16:31:13,609 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:31:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:13,615 INFO L225 Difference]: With dead ends: 4974 [2022-03-03 16:31:13,615 INFO L226 Difference]: Without dead ends: 4974 [2022-03-03 16:31:13,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1176, Invalid=2984, Unknown=0, NotChecked=0, Total=4160 [2022-03-03 16:31:13,615 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1197 mSDsluCounter, 4336 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 4676 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:13,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1197 Valid, 4676 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 16:31:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2022-03-03 16:31:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 4247. [2022-03-03 16:31:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 4244 states have (on average 2.048774740810556) internal successors, (8695), 4246 states have internal predecessors, (8695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 8695 transitions. [2022-03-03 16:31:13,658 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 8695 transitions. Word has length 96 [2022-03-03 16:31:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:13,658 INFO L470 AbstractCegarLoop]: Abstraction has 4247 states and 8695 transitions. [2022-03-03 16:31:13,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 8695 transitions. [2022-03-03 16:31:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:31:13,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:13,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:13,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-03 16:31:13,663 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash 686257333, now seen corresponding path program 21 times [2022-03-03 16:31:13,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:13,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502522927] [2022-03-03 16:31:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:14,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:14,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502522927] [2022-03-03 16:31:14,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502522927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:14,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:14,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-03 16:31:14,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356759661] [2022-03-03 16:31:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:14,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-03 16:31:14,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-03 16:31:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-03-03 16:31:14,240 INFO L87 Difference]: Start difference. First operand 4247 states and 8695 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:19,496 INFO L93 Difference]: Finished difference Result 4992 states and 10226 transitions. [2022-03-03 16:31:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-03 16:31:19,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:31:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:19,503 INFO L225 Difference]: With dead ends: 4992 [2022-03-03 16:31:19,503 INFO L226 Difference]: Without dead ends: 4992 [2022-03-03 16:31:19,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1203, Invalid=3087, Unknown=0, NotChecked=0, Total=4290 [2022-03-03 16:31:19,504 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1207 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:19,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1207 Valid, 4546 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 16:31:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2022-03-03 16:31:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4080. [2022-03-03 16:31:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4080 states, 4077 states have (on average 2.0466028942850136) internal successors, (8344), 4079 states have internal predecessors, (8344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 8344 transitions. [2022-03-03 16:31:19,561 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 8344 transitions. Word has length 96 [2022-03-03 16:31:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:19,562 INFO L470 AbstractCegarLoop]: Abstraction has 4080 states and 8344 transitions. [2022-03-03 16:31:19,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 8344 transitions. [2022-03-03 16:31:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:31:19,565 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:19,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:31:19,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-03 16:31:19,565 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2122112847, now seen corresponding path program 22 times [2022-03-03 16:31:19,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:19,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753956763] [2022-03-03 16:31:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:20,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:20,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753956763] [2022-03-03 16:31:20,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753956763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:20,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:20,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-03 16:31:20,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777024069] [2022-03-03 16:31:20,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:20,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-03 16:31:20,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-03 16:31:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-03-03 16:31:20,041 INFO L87 Difference]: Start difference. First operand 4080 states and 8344 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:25,300 INFO L93 Difference]: Finished difference Result 5029 states and 10300 transitions. [2022-03-03 16:31:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-03 16:31:25,301 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:31:25,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:25,306 INFO L225 Difference]: With dead ends: 5029 [2022-03-03 16:31:25,306 INFO L226 Difference]: Without dead ends: 5029 [2022-03-03 16:31:25,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1251, Invalid=3039, Unknown=0, NotChecked=0, Total=4290 [2022-03-03 16:31:25,308 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1263 mSDsluCounter, 3935 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 4285 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:25,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 4285 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 16:31:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2022-03-03 16:31:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 4017. [2022-03-03 16:31:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 4014 states have (on average 2.0455904334828103) internal successors, (8211), 4016 states have internal predecessors, (8211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 8211 transitions. [2022-03-03 16:31:25,350 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 8211 transitions. Word has length 96 [2022-03-03 16:31:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:25,350 INFO L470 AbstractCegarLoop]: Abstraction has 4017 states and 8211 transitions. [2022-03-03 16:31:25,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 8211 transitions. [2022-03-03 16:31:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:31:25,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:25,354 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] [2022-03-03 16:31:25,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-03 16:31:25,354 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash 435422575, now seen corresponding path program 23 times [2022-03-03 16:31:25,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:25,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678102859] [2022-03-03 16:31:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:25,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-03-03 16:31:25,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:25,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678102859] [2022-03-03 16:31:25,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678102859] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:25,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:25,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-03 16:31:25,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151495950] [2022-03-03 16:31:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:25,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-03 16:31:25,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:25,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-03 16:31:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-03-03 16:31:25,812 INFO L87 Difference]: Start difference. First operand 4017 states and 8211 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:38,322 INFO L93 Difference]: Finished difference Result 5491 states and 11242 transitions. [2022-03-03 16:31:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-03 16:31:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:31:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:38,328 INFO L225 Difference]: With dead ends: 5491 [2022-03-03 16:31:38,329 INFO L226 Difference]: Without dead ends: 5491 [2022-03-03 16:31:38,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=4244, Invalid=10518, Unknown=0, NotChecked=0, Total=14762 [2022-03-03 16:31:38,330 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 1246 mSDsluCounter, 5184 mSDsCounter, 0 mSdLazyCounter, 3119 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 5650 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:38,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 5650 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3119 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:31:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5491 states. [2022-03-03 16:31:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5491 to 4008. [2022-03-03 16:31:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4005 states have (on average 2.0454431960049937) internal successors, (8192), 4007 states have internal predecessors, (8192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 8192 transitions. [2022-03-03 16:31:38,376 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 8192 transitions. Word has length 96 [2022-03-03 16:31:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:38,376 INFO L470 AbstractCegarLoop]: Abstraction has 4008 states and 8192 transitions. [2022-03-03 16:31:38,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 8192 transitions. [2022-03-03 16:31:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-03 16:31:38,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:38,379 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] [2022-03-03 16:31:38,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-03 16:31:38,380 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1424536301, now seen corresponding path program 24 times [2022-03-03 16:31:38,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:38,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251960249] [2022-03-03 16:31:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:38,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:38,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251960249] [2022-03-03 16:31:38,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251960249] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:38,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:38,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-03 16:31:38,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013011008] [2022-03-03 16:31:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:38,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-03 16:31:38,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-03 16:31:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-03-03 16:31:38,868 INFO L87 Difference]: Start difference. First operand 4008 states and 8192 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:49,587 INFO L93 Difference]: Finished difference Result 4993 states and 10196 transitions. [2022-03-03 16:31:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-03 16:31:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-03 16:31:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:49,593 INFO L225 Difference]: With dead ends: 4993 [2022-03-03 16:31:49,593 INFO L226 Difference]: Without dead ends: 4993 [2022-03-03 16:31:49,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3743, Invalid=9367, Unknown=0, NotChecked=0, Total=13110 [2022-03-03 16:31:49,595 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 1207 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 4276 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:49,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1207 Valid, 4276 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 16:31:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2022-03-03 16:31:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 3630. [2022-03-03 16:31:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3627 states have (on average 2.044940722360077) internal successors, (7417), 3629 states have internal predecessors, (7417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 7417 transitions. [2022-03-03 16:31:49,633 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 7417 transitions. Word has length 96 [2022-03-03 16:31:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:49,633 INFO L470 AbstractCegarLoop]: Abstraction has 3630 states and 7417 transitions. [2022-03-03 16:31:49,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 7417 transitions. [2022-03-03 16:31:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:31:49,636 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:49,636 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] [2022-03-03 16:31:49,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-03 16:31:49,636 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1862634563, now seen corresponding path program 1 times [2022-03-03 16:31:49,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:49,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67039725] [2022-03-03 16:31:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31: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-03-03 16:31:50,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:50,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67039725] [2022-03-03 16:31:50,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67039725] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:50,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:50,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:31:50,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193017521] [2022-03-03 16:31:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:50,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:31:50,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:31:50,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:31:50,409 INFO L87 Difference]: Start difference. First operand 3630 states and 7417 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:31:54,904 INFO L93 Difference]: Finished difference Result 5451 states and 11188 transitions. [2022-03-03 16:31:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:31:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:31:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:31:54,910 INFO L225 Difference]: With dead ends: 5451 [2022-03-03 16:31:54,910 INFO L226 Difference]: Without dead ends: 5451 [2022-03-03 16:31:54,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:31:54,911 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 1622 mSDsluCounter, 9090 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 9615 SdHoareTripleChecker+Invalid, 3444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:31:54,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1622 Valid, 9615 Invalid, 3444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:31:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2022-03-03 16:31:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5035. [2022-03-03 16:31:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5032 states have (on average 2.050079491255962) internal successors, (10316), 5034 states have internal predecessors, (10316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 10316 transitions. [2022-03-03 16:31:54,984 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 10316 transitions. Word has length 99 [2022-03-03 16:31:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:31:54,984 INFO L470 AbstractCegarLoop]: Abstraction has 5035 states and 10316 transitions. [2022-03-03 16:31:54,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:31:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 10316 transitions. [2022-03-03 16:31:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:31:54,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:31:54,988 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] [2022-03-03 16:31:54,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-03 16:31:54,989 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:31:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:31:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1955278075, now seen corresponding path program 2 times [2022-03-03 16:31:54,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:31:54,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718861521] [2022-03-03 16:31:54,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:31:54,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:31:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:31:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:31:55,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:31:55,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718861521] [2022-03-03 16:31:55,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718861521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:31:55,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:31:55,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:31:55,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504960415] [2022-03-03 16:31:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:31:55,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:31:55,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:31:55,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:31:55,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:31:55,703 INFO L87 Difference]: Start difference. First operand 5035 states and 10316 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:00,377 INFO L93 Difference]: Finished difference Result 7775 states and 15958 transitions. [2022-03-03 16:32:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:32:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:00,386 INFO L225 Difference]: With dead ends: 7775 [2022-03-03 16:32:00,386 INFO L226 Difference]: Without dead ends: 7775 [2022-03-03 16:32:00,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1067, Invalid=5095, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:32:00,387 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1745 mSDsluCounter, 9266 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 9846 SdHoareTripleChecker+Invalid, 3327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:00,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1745 Valid, 9846 Invalid, 3327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:32:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2022-03-03 16:32:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 5095. [2022-03-03 16:32:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5092 states have (on average 2.0498821681068344) internal successors, (10438), 5094 states have internal predecessors, (10438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 10438 transitions. [2022-03-03 16:32:00,445 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 10438 transitions. Word has length 99 [2022-03-03 16:32:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:00,445 INFO L470 AbstractCegarLoop]: Abstraction has 5095 states and 10438 transitions. [2022-03-03 16:32:00,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 10438 transitions. [2022-03-03 16:32:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:00,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:00,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:32:00,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-03 16:32:00,450 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -748108651, now seen corresponding path program 3 times [2022-03-03 16:32:00,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:00,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003226425] [2022-03-03 16:32:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:01,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:01,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003226425] [2022-03-03 16:32:01,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003226425] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:01,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:01,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:32:01,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055936426] [2022-03-03 16:32:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:01,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:32:01,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:01,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:32:01,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:32:01,266 INFO L87 Difference]: Start difference. First operand 5095 states and 10438 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:05,789 INFO L93 Difference]: Finished difference Result 6743 states and 13827 transitions. [2022-03-03 16:32:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:05,790 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:05,797 INFO L225 Difference]: With dead ends: 6743 [2022-03-03 16:32:05,797 INFO L226 Difference]: Without dead ends: 6743 [2022-03-03 16:32:05,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=941, Invalid=4609, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:32:05,798 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1601 mSDsluCounter, 9030 mSDsCounter, 0 mSdLazyCounter, 3401 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 9592 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:05,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1601 Valid, 9592 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3401 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:32:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2022-03-03 16:32:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 5095. [2022-03-03 16:32:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5092 states have (on average 2.0498821681068344) internal successors, (10438), 5094 states have internal predecessors, (10438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 10438 transitions. [2022-03-03 16:32:05,853 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 10438 transitions. Word has length 99 [2022-03-03 16:32:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:05,853 INFO L470 AbstractCegarLoop]: Abstraction has 5095 states and 10438 transitions. [2022-03-03 16:32:05,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 10438 transitions. [2022-03-03 16:32:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:05,857 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:05,857 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] [2022-03-03 16:32:05,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-03 16:32:05,857 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash 547132675, now seen corresponding path program 4 times [2022-03-03 16:32:05,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:05,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176371213] [2022-03-03 16:32:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:05,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:06,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:06,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176371213] [2022-03-03 16:32:06,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176371213] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:06,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:06,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:32:06,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714650349] [2022-03-03 16:32:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:06,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:32:06,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:32:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:32:06,688 INFO L87 Difference]: Start difference. First operand 5095 states and 10438 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:11,302 INFO L93 Difference]: Finished difference Result 6828 states and 14014 transitions. [2022-03-03 16:32:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:11,302 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:11,309 INFO L225 Difference]: With dead ends: 6828 [2022-03-03 16:32:11,309 INFO L226 Difference]: Without dead ends: 6828 [2022-03-03 16:32:11,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:32:11,310 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1707 mSDsluCounter, 9575 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 10127 SdHoareTripleChecker+Invalid, 3813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:11,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1707 Valid, 10127 Invalid, 3813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:32:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6828 states. [2022-03-03 16:32:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6828 to 5112. [2022-03-03 16:32:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 5109 states have (on average 2.0497161871207674) internal successors, (10472), 5111 states have internal predecessors, (10472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 10472 transitions. [2022-03-03 16:32:11,354 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 10472 transitions. Word has length 99 [2022-03-03 16:32:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:11,354 INFO L470 AbstractCegarLoop]: Abstraction has 5112 states and 10472 transitions. [2022-03-03 16:32:11,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 10472 transitions. [2022-03-03 16:32:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:11,368 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:11,375 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] [2022-03-03 16:32:11,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-03 16:32:11,375 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2078168209, now seen corresponding path program 5 times [2022-03-03 16:32:11,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:11,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695128813] [2022-03-03 16:32:11,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:12,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:12,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695128813] [2022-03-03 16:32:12,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695128813] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:12,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:12,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-03-03 16:32:12,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278139203] [2022-03-03 16:32:12,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:12,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-03 16:32:12,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:12,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-03 16:32:12,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 16:32:12,347 INFO L87 Difference]: Start difference. First operand 5112 states and 10472 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:17,957 INFO L93 Difference]: Finished difference Result 7552 states and 15506 transitions. [2022-03-03 16:32:17,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-03 16:32:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:17,968 INFO L225 Difference]: With dead ends: 7552 [2022-03-03 16:32:17,968 INFO L226 Difference]: Without dead ends: 7552 [2022-03-03 16:32:17,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806 [2022-03-03 16:32:17,969 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 2038 mSDsluCounter, 9992 mSDsCounter, 0 mSdLazyCounter, 4120 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 10547 SdHoareTripleChecker+Invalid, 4168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:17,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2038 Valid, 10547 Invalid, 4168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4120 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:32:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2022-03-03 16:32:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 5411. [2022-03-03 16:32:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5411 states, 5408 states have (on average 2.0536242603550297) internal successors, (11106), 5410 states have internal predecessors, (11106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5411 states to 5411 states and 11106 transitions. [2022-03-03 16:32:18,043 INFO L78 Accepts]: Start accepts. Automaton has 5411 states and 11106 transitions. Word has length 99 [2022-03-03 16:32:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:18,043 INFO L470 AbstractCegarLoop]: Abstraction has 5411 states and 11106 transitions. [2022-03-03 16:32:18,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5411 states and 11106 transitions. [2022-03-03 16:32:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:18,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:18,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:32:18,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-03 16:32:18,048 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1114733107, now seen corresponding path program 6 times [2022-03-03 16:32:18,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:18,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428824199] [2022-03-03 16:32:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:18,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:18,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428824199] [2022-03-03 16:32:18,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428824199] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:18,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:18,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:32:18,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893832172] [2022-03-03 16:32:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:18,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:32:18,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:32:18,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:32:18,820 INFO L87 Difference]: Start difference. First operand 5411 states and 11106 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:23,466 INFO L93 Difference]: Finished difference Result 8331 states and 17112 transitions. [2022-03-03 16:32:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:23,475 INFO L225 Difference]: With dead ends: 8331 [2022-03-03 16:32:23,476 INFO L226 Difference]: Without dead ends: 8331 [2022-03-03 16:32:23,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:32:23,476 INFO L933 BasicCegarLoop]: 551 mSDtfsCounter, 1574 mSDsluCounter, 9568 mSDsCounter, 0 mSdLazyCounter, 3715 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 10119 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:23,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1574 Valid, 10119 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3715 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:32:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8331 states. [2022-03-03 16:32:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8331 to 5146. [2022-03-03 16:32:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5143 states have (on average 2.0493875170134164) internal successors, (10540), 5145 states have internal predecessors, (10540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 10540 transitions. [2022-03-03 16:32:23,533 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 10540 transitions. Word has length 99 [2022-03-03 16:32:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:23,533 INFO L470 AbstractCegarLoop]: Abstraction has 5146 states and 10540 transitions. [2022-03-03 16:32:23,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 10540 transitions. [2022-03-03 16:32:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:23,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:23,537 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] [2022-03-03 16:32:23,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-03 16:32:23,537 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash -428458567, now seen corresponding path program 7 times [2022-03-03 16:32:23,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:23,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436774663] [2022-03-03 16:32:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:24,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:24,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436774663] [2022-03-03 16:32:24,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436774663] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:24,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:24,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:32:24,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278007702] [2022-03-03 16:32:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:24,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:32:24,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:32:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:32:24,363 INFO L87 Difference]: Start difference. First operand 5146 states and 10540 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:28,904 INFO L93 Difference]: Finished difference Result 6964 states and 14286 transitions. [2022-03-03 16:32:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:28,905 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:28,912 INFO L225 Difference]: With dead ends: 6964 [2022-03-03 16:32:28,913 INFO L226 Difference]: Without dead ends: 6964 [2022-03-03 16:32:28,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=961, Invalid=4739, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:32:28,913 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1684 mSDsluCounter, 9282 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 9837 SdHoareTripleChecker+Invalid, 3681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:28,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1684 Valid, 9837 Invalid, 3681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3639 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:32:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6964 states. [2022-03-03 16:32:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6964 to 5197. [2022-03-03 16:32:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5197 states, 5194 states have (on average 2.0489025798998846) internal successors, (10642), 5196 states have internal predecessors, (10642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 10642 transitions. [2022-03-03 16:32:28,969 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 10642 transitions. Word has length 99 [2022-03-03 16:32:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:28,970 INFO L470 AbstractCegarLoop]: Abstraction has 5197 states and 10642 transitions. [2022-03-03 16:32:28,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 10642 transitions. [2022-03-03 16:32:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:28,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:28,974 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] [2022-03-03 16:32:28,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-03 16:32:28,974 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1400360845, now seen corresponding path program 8 times [2022-03-03 16:32:28,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:28,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537999912] [2022-03-03 16:32:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:29,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:29,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537999912] [2022-03-03 16:32:29,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537999912] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:29,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:29,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:32:29,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408213990] [2022-03-03 16:32:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:29,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:32:29,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:32:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:32:29,820 INFO L87 Difference]: Start difference. First operand 5197 states and 10642 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:34,372 INFO L93 Difference]: Finished difference Result 7032 states and 14422 transitions. [2022-03-03 16:32:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:34,380 INFO L225 Difference]: With dead ends: 7032 [2022-03-03 16:32:34,381 INFO L226 Difference]: Without dead ends: 7032 [2022-03-03 16:32:34,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=961, Invalid=4739, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:32:34,382 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1604 mSDsluCounter, 9419 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 9976 SdHoareTripleChecker+Invalid, 3610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:34,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1604 Valid, 9976 Invalid, 3610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:32:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2022-03-03 16:32:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 5214. [2022-03-03 16:32:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5214 states, 5211 states have (on average 2.0487430435616965) internal successors, (10676), 5213 states have internal predecessors, (10676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 10676 transitions. [2022-03-03 16:32:34,447 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 10676 transitions. Word has length 99 [2022-03-03 16:32:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:34,447 INFO L470 AbstractCegarLoop]: Abstraction has 5214 states and 10676 transitions. [2022-03-03 16:32:34,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 10676 transitions. [2022-03-03 16:32:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:34,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:34,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] [2022-03-03 16:32:34,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-03 16:32:34,451 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:34,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1762139035, now seen corresponding path program 9 times [2022-03-03 16:32:34,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:34,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260661213] [2022-03-03 16:32:34,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:35,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:35,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260661213] [2022-03-03 16:32:35,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260661213] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:35,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:35,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-03-03 16:32:35,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974669039] [2022-03-03 16:32:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:35,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-03 16:32:35,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-03 16:32:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 16:32:35,493 INFO L87 Difference]: Start difference. First operand 5214 states and 10676 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:42,158 INFO L93 Difference]: Finished difference Result 8102 states and 16650 transitions. [2022-03-03 16:32:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-03 16:32:42,158 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:42,166 INFO L225 Difference]: With dead ends: 8102 [2022-03-03 16:32:42,166 INFO L226 Difference]: Without dead ends: 8102 [2022-03-03 16:32:42,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1404, Invalid=7152, Unknown=0, NotChecked=0, Total=8556 [2022-03-03 16:32:42,167 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1944 mSDsluCounter, 11748 mSDsCounter, 0 mSdLazyCounter, 4934 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 12310 SdHoareTripleChecker+Invalid, 4983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:42,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1944 Valid, 12310 Invalid, 4983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4934 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:32:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8102 states. [2022-03-03 16:32:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8102 to 5598. [2022-03-03 16:32:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5598 states, 5595 states have (on average 2.05183199285076) internal successors, (11480), 5597 states have internal predecessors, (11480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 11480 transitions. [2022-03-03 16:32:42,235 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 11480 transitions. Word has length 99 [2022-03-03 16:32:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:42,235 INFO L470 AbstractCegarLoop]: Abstraction has 5598 states and 11480 transitions. [2022-03-03 16:32:42,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 11480 transitions. [2022-03-03 16:32:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:42,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:42,239 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] [2022-03-03 16:32:42,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-03 16:32:42,239 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:42,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash -660073055, now seen corresponding path program 10 times [2022-03-03 16:32:42,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:42,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756630791] [2022-03-03 16:32:42,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:43,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:43,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756630791] [2022-03-03 16:32:43,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756630791] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:43,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:43,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:32:43,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136151285] [2022-03-03 16:32:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:43,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:32:43,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:43,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:32:43,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:32:43,007 INFO L87 Difference]: Start difference. First operand 5598 states and 11480 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:47,471 INFO L93 Difference]: Finished difference Result 8518 states and 17486 transitions. [2022-03-03 16:32:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:47,472 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:47,481 INFO L225 Difference]: With dead ends: 8518 [2022-03-03 16:32:47,481 INFO L226 Difference]: Without dead ends: 8518 [2022-03-03 16:32:47,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:32:47,482 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1574 mSDsluCounter, 9259 mSDsCounter, 0 mSdLazyCounter, 3468 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 9817 SdHoareTripleChecker+Invalid, 3501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:47,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1574 Valid, 9817 Invalid, 3501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3468 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:32:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8518 states. [2022-03-03 16:32:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8518 to 5231. [2022-03-03 16:32:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5228 states have (on average 2.04858454475899) internal successors, (10710), 5230 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 10710 transitions. [2022-03-03 16:32:47,550 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 10710 transitions. Word has length 99 [2022-03-03 16:32:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:47,550 INFO L470 AbstractCegarLoop]: Abstraction has 5231 states and 10710 transitions. [2022-03-03 16:32:47,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 10710 transitions. [2022-03-03 16:32:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:47,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:47,554 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] [2022-03-03 16:32:47,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-03 16:32:47,554 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1514557837, now seen corresponding path program 11 times [2022-03-03 16:32:47,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:47,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606506781] [2022-03-03 16:32:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:47,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:48,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:48,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606506781] [2022-03-03 16:32:48,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606506781] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:48,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:48,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:32:48,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899415474] [2022-03-03 16:32:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:48,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:32:48,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:48,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:32:48,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:32:48,300 INFO L87 Difference]: Start difference. First operand 5231 states and 10710 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:52,931 INFO L93 Difference]: Finished difference Result 7134 states and 14626 transitions. [2022-03-03 16:32:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:52,931 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:52,939 INFO L225 Difference]: With dead ends: 7134 [2022-03-03 16:32:52,939 INFO L226 Difference]: Without dead ends: 7134 [2022-03-03 16:32:52,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:32:52,940 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1533 mSDsluCounter, 10051 mSDsCounter, 0 mSdLazyCounter, 3844 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 10611 SdHoareTripleChecker+Invalid, 3877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:52,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 10611 Invalid, 3877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3844 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:32:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2022-03-03 16:32:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 5282. [2022-03-03 16:32:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5282 states, 5279 states have (on average 2.048115173328282) internal successors, (10812), 5281 states have internal predecessors, (10812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 10812 transitions. [2022-03-03 16:32:52,994 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 10812 transitions. Word has length 99 [2022-03-03 16:32:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:52,994 INFO L470 AbstractCegarLoop]: Abstraction has 5282 states and 10812 transitions. [2022-03-03 16:32:52,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 10812 transitions. [2022-03-03 16:32:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:52,998 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:52,998 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] [2022-03-03 16:32:52,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-03 16:32:52,998 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1227029339, now seen corresponding path program 12 times [2022-03-03 16:32:52,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:52,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433047312] [2022-03-03 16:32:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:53,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:53,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433047312] [2022-03-03 16:32:53,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433047312] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:53,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:53,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:32:53,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421977908] [2022-03-03 16:32:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:53,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:32:53,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:32:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:32:53,897 INFO L87 Difference]: Start difference. First operand 5282 states and 10812 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:32:58,148 INFO L93 Difference]: Finished difference Result 6845 states and 14031 transitions. [2022-03-03 16:32:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:32:58,149 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:32:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:32:58,156 INFO L225 Difference]: With dead ends: 6845 [2022-03-03 16:32:58,156 INFO L226 Difference]: Without dead ends: 6845 [2022-03-03 16:32:58,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=961, Invalid=4739, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:32:58,157 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 1552 mSDsluCounter, 8872 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 9437 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:32:58,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1552 Valid, 9437 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 16:32:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2022-03-03 16:32:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 5112. [2022-03-03 16:32:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 5109 states have (on average 2.0497161871207674) internal successors, (10472), 5111 states have internal predecessors, (10472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 10472 transitions. [2022-03-03 16:32:58,204 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 10472 transitions. Word has length 99 [2022-03-03 16:32:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:32:58,205 INFO L470 AbstractCegarLoop]: Abstraction has 5112 states and 10472 transitions. [2022-03-03 16:32:58,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:32:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 10472 transitions. [2022-03-03 16:32:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:32:58,208 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:32:58,208 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] [2022-03-03 16:32:58,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-03 16:32:58,209 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:32:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:32:58,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1850403261, now seen corresponding path program 13 times [2022-03-03 16:32:58,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:32:58,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225446907] [2022-03-03 16:32:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:32:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:32:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:32:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:32:59,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:32:59,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225446907] [2022-03-03 16:32:59,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225446907] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:32:59,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:32:59,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:32:59,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046801068] [2022-03-03 16:32:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:32:59,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:32:59,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:32:59,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:32:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:32:59,002 INFO L87 Difference]: Start difference. First operand 5112 states and 10472 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:03,418 INFO L93 Difference]: Finished difference Result 7360 states and 15119 transitions. [2022-03-03 16:33:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:33:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:03,426 INFO L225 Difference]: With dead ends: 7360 [2022-03-03 16:33:03,426 INFO L226 Difference]: Without dead ends: 7360 [2022-03-03 16:33:03,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:33:03,427 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1499 mSDsluCounter, 9184 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 9742 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:03,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 9742 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3366 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:33:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2022-03-03 16:33:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 5137. [2022-03-03 16:33:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5137 states, 5134 states have (on average 2.0500584339696144) internal successors, (10525), 5136 states have internal predecessors, (10525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5137 states to 5137 states and 10525 transitions. [2022-03-03 16:33:03,475 INFO L78 Accepts]: Start accepts. Automaton has 5137 states and 10525 transitions. Word has length 99 [2022-03-03 16:33:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:03,475 INFO L470 AbstractCegarLoop]: Abstraction has 5137 states and 10525 transitions. [2022-03-03 16:33:03,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5137 states and 10525 transitions. [2022-03-03 16:33:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:03,478 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:03,478 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] [2022-03-03 16:33:03,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-03 16:33:03,479 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1757759749, now seen corresponding path program 14 times [2022-03-03 16:33:03,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:03,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959144306] [2022-03-03 16:33:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:04,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:04,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959144306] [2022-03-03 16:33:04,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959144306] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:04,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:04,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:33:04,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88897786] [2022-03-03 16:33:04,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:04,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:33:04,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:33:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:33:04,191 INFO L87 Difference]: Start difference. First operand 5137 states and 10525 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:09,134 INFO L93 Difference]: Finished difference Result 9400 states and 19327 transitions. [2022-03-03 16:33:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:33:09,135 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:09,144 INFO L225 Difference]: With dead ends: 9400 [2022-03-03 16:33:09,144 INFO L226 Difference]: Without dead ends: 9400 [2022-03-03 16:33:09,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:33:09,145 INFO L933 BasicCegarLoop]: 604 mSDtfsCounter, 1691 mSDsluCounter, 10201 mSDsCounter, 0 mSdLazyCounter, 3738 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 10805 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:09,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1691 Valid, 10805 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3738 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:33:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2022-03-03 16:33:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 5139. [2022-03-03 16:33:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 5136 states have (on average 2.050038940809969) internal successors, (10529), 5138 states have internal predecessors, (10529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 10529 transitions. [2022-03-03 16:33:09,199 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 10529 transitions. Word has length 99 [2022-03-03 16:33:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:09,199 INFO L470 AbstractCegarLoop]: Abstraction has 5139 states and 10529 transitions. [2022-03-03 16:33:09,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 10529 transitions. [2022-03-03 16:33:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:09,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:09,203 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] [2022-03-03 16:33:09,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-03 16:33:09,203 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1330038123, now seen corresponding path program 15 times [2022-03-03 16:33:09,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:09,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260415909] [2022-03-03 16:33:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:09,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:09,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260415909] [2022-03-03 16:33:09,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260415909] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:09,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:09,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:33:09,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434163922] [2022-03-03 16:33:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:09,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:33:09,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:33:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:33:09,948 INFO L87 Difference]: Start difference. First operand 5139 states and 10529 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:14,369 INFO L93 Difference]: Finished difference Result 7442 states and 15285 transitions. [2022-03-03 16:33:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:33:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:14,377 INFO L225 Difference]: With dead ends: 7442 [2022-03-03 16:33:14,377 INFO L226 Difference]: Without dead ends: 7442 [2022-03-03 16:33:14,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:33:14,378 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 1766 mSDsluCounter, 8667 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 9239 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:14,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1766 Valid, 9239 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:33:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7442 states. [2022-03-03 16:33:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7442 to 5121. [2022-03-03 16:33:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5121 states, 5118 states have (on average 2.0498241500586167) internal successors, (10491), 5120 states have internal predecessors, (10491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5121 states to 5121 states and 10491 transitions. [2022-03-03 16:33:14,434 INFO L78 Accepts]: Start accepts. Automaton has 5121 states and 10491 transitions. Word has length 99 [2022-03-03 16:33:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:14,435 INFO L470 AbstractCegarLoop]: Abstraction has 5121 states and 10491 transitions. [2022-03-03 16:33:14,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5121 states and 10491 transitions. [2022-03-03 16:33:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:14,438 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:14,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:14,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-03 16:33:14,439 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash 969706245, now seen corresponding path program 16 times [2022-03-03 16:33:14,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:14,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167633940] [2022-03-03 16:33:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:15,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:15,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167633940] [2022-03-03 16:33:15,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167633940] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:15,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:15,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:33:15,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022605023] [2022-03-03 16:33:15,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:15,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:33:15,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:33:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:33:15,117 INFO L87 Difference]: Start difference. First operand 5121 states and 10491 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:20,480 INFO L93 Difference]: Finished difference Result 8427 states and 17291 transitions. [2022-03-03 16:33:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:33:20,481 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:20,490 INFO L225 Difference]: With dead ends: 8427 [2022-03-03 16:33:20,490 INFO L226 Difference]: Without dead ends: 8427 [2022-03-03 16:33:20,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1166, Invalid=5314, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 16:33:20,491 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 1929 mSDsluCounter, 10617 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 11214 SdHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:20,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1929 Valid, 11214 Invalid, 3865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:33:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8427 states. [2022-03-03 16:33:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8427 to 5228. [2022-03-03 16:33:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 5225 states have (on average 2.049377990430622) internal successors, (10708), 5227 states have internal predecessors, (10708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 10708 transitions. [2022-03-03 16:33:20,574 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 10708 transitions. Word has length 99 [2022-03-03 16:33:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:20,575 INFO L470 AbstractCegarLoop]: Abstraction has 5228 states and 10708 transitions. [2022-03-03 16:33:20,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 10708 transitions. [2022-03-03 16:33:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:20,578 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:20,578 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] [2022-03-03 16:33:20,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-03 16:33:20,578 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash 948513173, now seen corresponding path program 17 times [2022-03-03 16:33:20,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:20,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786258376] [2022-03-03 16:33:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:21,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:21,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786258376] [2022-03-03 16:33:21,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786258376] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:21,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:21,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:33:21,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86960808] [2022-03-03 16:33:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:21,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:33:21,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:33:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:33:21,395 INFO L87 Difference]: Start difference. First operand 5228 states and 10708 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:26,217 INFO L93 Difference]: Finished difference Result 8395 states and 17222 transitions. [2022-03-03 16:33:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:33:26,218 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:26,228 INFO L225 Difference]: With dead ends: 8395 [2022-03-03 16:33:26,228 INFO L226 Difference]: Without dead ends: 8395 [2022-03-03 16:33:26,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1060, Invalid=5102, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:33:26,229 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1792 mSDsluCounter, 10124 mSDsCounter, 0 mSdLazyCounter, 3713 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 10703 SdHoareTripleChecker+Invalid, 3755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:26,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1792 Valid, 10703 Invalid, 3755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3713 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:33:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2022-03-03 16:33:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 5230. [2022-03-03 16:33:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 5227 states have (on average 2.049359096996365) internal successors, (10712), 5229 states have internal predecessors, (10712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 10712 transitions. [2022-03-03 16:33:26,296 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 10712 transitions. Word has length 99 [2022-03-03 16:33:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:26,297 INFO L470 AbstractCegarLoop]: Abstraction has 5230 states and 10712 transitions. [2022-03-03 16:33:26,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 10712 transitions. [2022-03-03 16:33:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:26,313 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:26,313 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] [2022-03-03 16:33:26,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-03 16:33:26,313 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -885464299, now seen corresponding path program 18 times [2022-03-03 16:33:26,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:26,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500381399] [2022-03-03 16:33:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:26,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:26,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500381399] [2022-03-03 16:33:26,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500381399] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:26,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:26,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-03-03 16:33:26,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127940197] [2022-03-03 16:33:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:26,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-03 16:33:26,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:26,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-03 16:33:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2022-03-03 16:33:26,949 INFO L87 Difference]: Start difference. First operand 5230 states and 10712 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:31,216 INFO L93 Difference]: Finished difference Result 7350 states and 15068 transitions. [2022-03-03 16:33:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 16:33:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:31,225 INFO L225 Difference]: With dead ends: 7350 [2022-03-03 16:33:31,225 INFO L226 Difference]: Without dead ends: 7350 [2022-03-03 16:33:31,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=900, Invalid=4356, Unknown=0, NotChecked=0, Total=5256 [2022-03-03 16:33:31,225 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 1520 mSDsluCounter, 9060 mSDsCounter, 0 mSdLazyCounter, 3396 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 9600 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:31,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1520 Valid, 9600 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3396 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:33:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7350 states. [2022-03-03 16:33:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7350 to 5250. [2022-03-03 16:33:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5250 states, 5247 states have (on average 2.0491709548313324) internal successors, (10752), 5249 states have internal predecessors, (10752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 10752 transitions. [2022-03-03 16:33:31,281 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 10752 transitions. Word has length 99 [2022-03-03 16:33:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:31,281 INFO L470 AbstractCegarLoop]: Abstraction has 5250 states and 10752 transitions. [2022-03-03 16:33:31,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 10752 transitions. [2022-03-03 16:33:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:31,285 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:31,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:31,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-03 16:33:31,286 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash -917579705, now seen corresponding path program 19 times [2022-03-03 16:33:31,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:31,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460858561] [2022-03-03 16:33:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:32,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:32,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460858561] [2022-03-03 16:33:32,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460858561] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:32,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:32,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-03-03 16:33:32,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808245099] [2022-03-03 16:33:32,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:32,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-03 16:33:32,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-03 16:33:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 16:33:32,310 INFO L87 Difference]: Start difference. First operand 5250 states and 10752 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:37,699 INFO L93 Difference]: Finished difference Result 8278 states and 17019 transitions. [2022-03-03 16:33:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-03 16:33:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:37,709 INFO L225 Difference]: With dead ends: 8278 [2022-03-03 16:33:37,709 INFO L226 Difference]: Without dead ends: 8278 [2022-03-03 16:33:37,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1134, Invalid=5672, Unknown=0, NotChecked=0, Total=6806 [2022-03-03 16:33:37,710 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1809 mSDsluCounter, 9161 mSDsCounter, 0 mSdLazyCounter, 3670 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 9728 SdHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:37,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1809 Valid, 9728 Invalid, 3714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3670 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:33:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2022-03-03 16:33:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 5561. [2022-03-03 16:33:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5561 states, 5558 states have (on average 2.056315221302627) internal successors, (11429), 5560 states have internal predecessors, (11429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 11429 transitions. [2022-03-03 16:33:37,777 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 11429 transitions. Word has length 99 [2022-03-03 16:33:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:37,777 INFO L470 AbstractCegarLoop]: Abstraction has 5561 states and 11429 transitions. [2022-03-03 16:33:37,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 11429 transitions. [2022-03-03 16:33:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:37,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:37,782 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] [2022-03-03 16:33:37,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-03 16:33:37,782 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash 184486275, now seen corresponding path program 20 times [2022-03-03 16:33:37,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:37,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541127322] [2022-03-03 16:33:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:38,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-03-03 16:33:38,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:38,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541127322] [2022-03-03 16:33:38,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541127322] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:38,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:38,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:33:38,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603844787] [2022-03-03 16:33:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:38,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:33:38,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:38,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:33:38,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:33:38,603 INFO L87 Difference]: Start difference. First operand 5561 states and 11429 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:43,261 INFO L93 Difference]: Finished difference Result 9074 states and 18659 transitions. [2022-03-03 16:33:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:33:43,261 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:43,270 INFO L225 Difference]: With dead ends: 9074 [2022-03-03 16:33:43,270 INFO L226 Difference]: Without dead ends: 9074 [2022-03-03 16:33:43,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:33:43,271 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1549 mSDsluCounter, 9934 mSDsCounter, 0 mSdLazyCounter, 3873 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 10497 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:43,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 10497 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3873 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:33:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9074 states. [2022-03-03 16:33:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9074 to 5268. [2022-03-03 16:33:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5265 states have (on average 2.049382716049383) internal successors, (10790), 5267 states have internal predecessors, (10790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 10790 transitions. [2022-03-03 16:33:43,340 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 10790 transitions. Word has length 99 [2022-03-03 16:33:43,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:43,340 INFO L470 AbstractCegarLoop]: Abstraction has 5268 states and 10790 transitions. [2022-03-03 16:33:43,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 10790 transitions. [2022-03-03 16:33:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:43,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:43,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:43,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-03 16:33:43,344 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1010223217, now seen corresponding path program 21 times [2022-03-03 16:33:43,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:43,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181226823] [2022-03-03 16:33:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:44,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:44,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181226823] [2022-03-03 16:33:44,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181226823] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:44,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:44,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:33:44,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434063013] [2022-03-03 16:33:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:44,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:33:44,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:33:44,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:33:44,128 INFO L87 Difference]: Start difference. First operand 5268 states and 10790 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:49,443 INFO L93 Difference]: Finished difference Result 9569 states and 19666 transitions. [2022-03-03 16:33:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:33:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:49,456 INFO L225 Difference]: With dead ends: 9569 [2022-03-03 16:33:49,456 INFO L226 Difference]: Without dead ends: 9569 [2022-03-03 16:33:49,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:33:49,457 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 1746 mSDsluCounter, 11442 mSDsCounter, 0 mSdLazyCounter, 4250 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 12051 SdHoareTripleChecker+Invalid, 4289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:49,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1746 Valid, 12051 Invalid, 4289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4250 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:33:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9569 states. [2022-03-03 16:33:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9569 to 5270. [2022-03-03 16:33:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5270 states, 5267 states have (on average 2.0493639643060564) internal successors, (10794), 5269 states have internal predecessors, (10794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 10794 transitions. [2022-03-03 16:33:49,526 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 10794 transitions. Word has length 99 [2022-03-03 16:33:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:49,526 INFO L470 AbstractCegarLoop]: Abstraction has 5270 states and 10794 transitions. [2022-03-03 16:33:49,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 10794 transitions. [2022-03-03 16:33:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:49,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:49,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:33:49,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-03 16:33:49,530 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 196946207, now seen corresponding path program 22 times [2022-03-03 16:33:49,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:49,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427375427] [2022-03-03 16:33:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:50,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:50,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427375427] [2022-03-03 16:33:50,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427375427] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:50,188 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:50,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-03-03 16:33:50,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352912844] [2022-03-03 16:33:50,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:50,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-03 16:33:50,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-03 16:33:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2022-03-03 16:33:50,189 INFO L87 Difference]: Start difference. First operand 5270 states and 10794 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:33:54,585 INFO L93 Difference]: Finished difference Result 7679 states and 15760 transitions. [2022-03-03 16:33:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 16:33:54,586 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:33:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:33:54,593 INFO L225 Difference]: With dead ends: 7679 [2022-03-03 16:33:54,594 INFO L226 Difference]: Without dead ends: 7679 [2022-03-03 16:33:54,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=902, Invalid=4354, Unknown=0, NotChecked=0, Total=5256 [2022-03-03 16:33:54,594 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1594 mSDsluCounter, 9525 mSDsCounter, 0 mSdLazyCounter, 3529 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 10088 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:33:54,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1594 Valid, 10088 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3529 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:33:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7679 states. [2022-03-03 16:33:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7679 to 5252. [2022-03-03 16:33:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 5249 states have (on average 2.0491522194703755) internal successors, (10756), 5251 states have internal predecessors, (10756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 10756 transitions. [2022-03-03 16:33:54,645 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 10756 transitions. Word has length 99 [2022-03-03 16:33:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:33:54,645 INFO L470 AbstractCegarLoop]: Abstraction has 5252 states and 10756 transitions. [2022-03-03 16:33:54,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:33:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 10756 transitions. [2022-03-03 16:33:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:33:54,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:33:54,649 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] [2022-03-03 16:33:54,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-03 16:33:54,649 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:33:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:33:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1806797157, now seen corresponding path program 23 times [2022-03-03 16:33:54,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:33:54,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158424439] [2022-03-03 16:33:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:33:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:33:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:33:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:33:55,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:33:55,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158424439] [2022-03-03 16:33:55,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158424439] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:33:55,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:33:55,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:33:55,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791317998] [2022-03-03 16:33:55,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:33:55,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:33:55,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:33:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:33:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:33:55,482 INFO L87 Difference]: Start difference. First operand 5252 states and 10756 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:00,117 INFO L93 Difference]: Finished difference Result 7366 states and 15115 transitions. [2022-03-03 16:34:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:00,126 INFO L225 Difference]: With dead ends: 7366 [2022-03-03 16:34:00,126 INFO L226 Difference]: Without dead ends: 7366 [2022-03-03 16:34:00,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:34:00,127 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 1523 mSDsluCounter, 9974 mSDsCounter, 0 mSdLazyCounter, 3893 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 10535 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:00,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1523 Valid, 10535 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3893 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:34:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2022-03-03 16:34:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 5250. [2022-03-03 16:34:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5250 states, 5247 states have (on average 2.0491709548313324) internal successors, (10752), 5249 states have internal predecessors, (10752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 10752 transitions. [2022-03-03 16:34:00,189 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 10752 transitions. Word has length 99 [2022-03-03 16:34:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:00,189 INFO L470 AbstractCegarLoop]: Abstraction has 5250 states and 10752 transitions. [2022-03-03 16:34:00,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 10752 transitions. [2022-03-03 16:34:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:00,193 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:00,193 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] [2022-03-03 16:34:00,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-03 16:34:00,193 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1671774703, now seen corresponding path program 24 times [2022-03-03 16:34:00,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:00,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879339872] [2022-03-03 16:34:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:01,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:01,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879339872] [2022-03-03 16:34:01,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879339872] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:01,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:01,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:34:01,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631888917] [2022-03-03 16:34:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:01,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:34:01,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:01,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:34:01,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:34:01,036 INFO L87 Difference]: Start difference. First operand 5250 states and 10752 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:05,630 INFO L93 Difference]: Finished difference Result 7702 states and 15825 transitions. [2022-03-03 16:34:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:05,630 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:05,639 INFO L225 Difference]: With dead ends: 7702 [2022-03-03 16:34:05,639 INFO L226 Difference]: Without dead ends: 7702 [2022-03-03 16:34:05,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:34:05,640 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1734 mSDsluCounter, 9328 mSDsCounter, 0 mSdLazyCounter, 3655 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 9891 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:05,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1734 Valid, 9891 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3655 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:34:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7702 states. [2022-03-03 16:34:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7702 to 5408. [2022-03-03 16:34:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5408 states, 5405 states have (on average 2.0512488436632745) internal successors, (11087), 5407 states have internal predecessors, (11087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 11087 transitions. [2022-03-03 16:34:05,704 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 11087 transitions. Word has length 99 [2022-03-03 16:34:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:05,704 INFO L470 AbstractCegarLoop]: Abstraction has 5408 states and 11087 transitions. [2022-03-03 16:34:05,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 11087 transitions. [2022-03-03 16:34:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:05,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:05,709 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] [2022-03-03 16:34:05,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-03 16:34:05,710 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1764418215, now seen corresponding path program 25 times [2022-03-03 16:34:05,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:05,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53858777] [2022-03-03 16:34:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:06,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-03-03 16:34:06,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:06,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53858777] [2022-03-03 16:34:06,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53858777] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:06,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:06,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:34:06,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540140127] [2022-03-03 16:34:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:06,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:34:06,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:34:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:34:06,505 INFO L87 Difference]: Start difference. First operand 5408 states and 11087 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:11,454 INFO L93 Difference]: Finished difference Result 9672 states and 19876 transitions. [2022-03-03 16:34:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:34:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:11,471 INFO L225 Difference]: With dead ends: 9672 [2022-03-03 16:34:11,472 INFO L226 Difference]: Without dead ends: 9672 [2022-03-03 16:34:11,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:34:11,472 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 1864 mSDsluCounter, 9920 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 10529 SdHoareTripleChecker+Invalid, 3819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:11,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1864 Valid, 10529 Invalid, 3819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3775 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:34:11,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2022-03-03 16:34:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 5410. [2022-03-03 16:34:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5410 states, 5407 states have (on average 2.051229887183281) internal successors, (11091), 5409 states have internal predecessors, (11091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5410 states to 5410 states and 11091 transitions. [2022-03-03 16:34:11,532 INFO L78 Accepts]: Start accepts. Automaton has 5410 states and 11091 transitions. Word has length 99 [2022-03-03 16:34:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:11,532 INFO L470 AbstractCegarLoop]: Abstraction has 5410 states and 11091 transitions. [2022-03-03 16:34:11,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5410 states and 11091 transitions. [2022-03-03 16:34:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:11,536 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:11,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:34:11,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-03 16:34:11,536 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash -557248791, now seen corresponding path program 26 times [2022-03-03 16:34:11,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:11,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418877323] [2022-03-03 16:34:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:11,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:12,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:12,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418877323] [2022-03-03 16:34:12,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418877323] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:12,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:12,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:34:12,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092030590] [2022-03-03 16:34:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:12,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:34:12,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:12,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:34:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:34:12,275 INFO L87 Difference]: Start difference. First operand 5410 states and 11091 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:16,676 INFO L93 Difference]: Finished difference Result 7765 states and 15934 transitions. [2022-03-03 16:34:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:16,676 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:16,686 INFO L225 Difference]: With dead ends: 7765 [2022-03-03 16:34:16,686 INFO L226 Difference]: Without dead ends: 7765 [2022-03-03 16:34:16,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:34:16,687 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1541 mSDsluCounter, 9385 mSDsCounter, 0 mSdLazyCounter, 3486 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 9962 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:16,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 9962 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3486 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:34:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7765 states. [2022-03-03 16:34:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7765 to 5408. [2022-03-03 16:34:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5408 states, 5405 states have (on average 2.0512488436632745) internal successors, (11087), 5407 states have internal predecessors, (11087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 11087 transitions. [2022-03-03 16:34:16,750 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 11087 transitions. Word has length 99 [2022-03-03 16:34:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:16,751 INFO L470 AbstractCegarLoop]: Abstraction has 5408 states and 11087 transitions. [2022-03-03 16:34:16,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 11087 transitions. [2022-03-03 16:34:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:16,755 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:16,755 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] [2022-03-03 16:34:16,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-03 16:34:16,755 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1052602159, now seen corresponding path program 27 times [2022-03-03 16:34:16,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:16,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174108616] [2022-03-03 16:34:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:17,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:17,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174108616] [2022-03-03 16:34:17,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174108616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:17,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:17,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:34:17,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821659099] [2022-03-03 16:34:17,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:17,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:34:17,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:17,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:34:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:34:17,570 INFO L87 Difference]: Start difference. First operand 5408 states and 11087 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:22,255 INFO L93 Difference]: Finished difference Result 7787 states and 15995 transitions. [2022-03-03 16:34:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:22,269 INFO L225 Difference]: With dead ends: 7787 [2022-03-03 16:34:22,269 INFO L226 Difference]: Without dead ends: 7787 [2022-03-03 16:34:22,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:34:22,269 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1763 mSDsluCounter, 9941 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 10508 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:22,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1763 Valid, 10508 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3869 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:34:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7787 states. [2022-03-03 16:34:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7787 to 5425. [2022-03-03 16:34:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5425 states, 5422 states have (on average 2.051088159350793) internal successors, (11121), 5424 states have internal predecessors, (11121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 11121 transitions. [2022-03-03 16:34:22,329 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 11121 transitions. Word has length 99 [2022-03-03 16:34:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:22,329 INFO L470 AbstractCegarLoop]: Abstraction has 5425 states and 11121 transitions. [2022-03-03 16:34:22,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 11121 transitions. [2022-03-03 16:34:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:22,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:22,333 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] [2022-03-03 16:34:22,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-03 16:34:22,334 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1129847727, now seen corresponding path program 28 times [2022-03-03 16:34:22,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:22,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204378405] [2022-03-03 16:34:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:23,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:23,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204378405] [2022-03-03 16:34:23,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204378405] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:23,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:23,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:34:23,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511976402] [2022-03-03 16:34:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:23,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:34:23,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:34:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:34:23,131 INFO L87 Difference]: Start difference. First operand 5425 states and 11121 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:27,607 INFO L93 Difference]: Finished difference Result 7615 states and 15634 transitions. [2022-03-03 16:34:27,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:27,623 INFO L225 Difference]: With dead ends: 7615 [2022-03-03 16:34:27,623 INFO L226 Difference]: Without dead ends: 7615 [2022-03-03 16:34:27,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:34:27,624 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1636 mSDsluCounter, 9148 mSDsCounter, 0 mSdLazyCounter, 3514 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 9708 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:27,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1636 Valid, 9708 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3514 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:34:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7615 states. [2022-03-03 16:34:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7615 to 5459. [2022-03-03 16:34:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5459 states, 5456 states have (on average 2.0507697947214076) internal successors, (11189), 5458 states have internal predecessors, (11189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5459 states to 5459 states and 11189 transitions. [2022-03-03 16:34:27,674 INFO L78 Accepts]: Start accepts. Automaton has 5459 states and 11189 transitions. Word has length 99 [2022-03-03 16:34:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:27,674 INFO L470 AbstractCegarLoop]: Abstraction has 5459 states and 11189 transitions. [2022-03-03 16:34:27,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5459 states and 11189 transitions. [2022-03-03 16:34:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:27,678 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:27,678 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] [2022-03-03 16:34:27,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-03 16:34:27,678 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2006338119, now seen corresponding path program 29 times [2022-03-03 16:34:27,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:27,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736662066] [2022-03-03 16:34:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:28,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:28,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736662066] [2022-03-03 16:34:28,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736662066] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:28,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:28,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:34:28,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745019018] [2022-03-03 16:34:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:28,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:34:28,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:34:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:34:28,500 INFO L87 Difference]: Start difference. First operand 5459 states and 11189 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:33,204 INFO L93 Difference]: Finished difference Result 7968 states and 16376 transitions. [2022-03-03 16:34:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:33,204 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:33,213 INFO L225 Difference]: With dead ends: 7968 [2022-03-03 16:34:33,213 INFO L226 Difference]: Without dead ends: 7968 [2022-03-03 16:34:33,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:34:33,214 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 1685 mSDsluCounter, 9367 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 9935 SdHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:33,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1685 Valid, 9935 Invalid, 3748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:34:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7968 states. [2022-03-03 16:34:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7968 to 5487. [2022-03-03 16:34:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5487 states, 5484 states have (on average 2.050875273522976) internal successors, (11247), 5486 states have internal predecessors, (11247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 11247 transitions. [2022-03-03 16:34:33,281 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 11247 transitions. Word has length 99 [2022-03-03 16:34:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:33,281 INFO L470 AbstractCegarLoop]: Abstraction has 5487 states and 11247 transitions. [2022-03-03 16:34:33,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 11247 transitions. [2022-03-03 16:34:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:33,285 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:33,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:34:33,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-03 16:34:33,285 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2098981631, now seen corresponding path program 30 times [2022-03-03 16:34:33,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:33,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268067711] [2022-03-03 16:34:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:33,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:33,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268067711] [2022-03-03 16:34:33,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268067711] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:33,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:33,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:34:33,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327533740] [2022-03-03 16:34:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:33,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:34:33,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:33,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:34:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:34:33,972 INFO L87 Difference]: Start difference. First operand 5487 states and 11247 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:38,978 INFO L93 Difference]: Finished difference Result 9938 states and 20427 transitions. [2022-03-03 16:34:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:34:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:38,989 INFO L225 Difference]: With dead ends: 9938 [2022-03-03 16:34:38,989 INFO L226 Difference]: Without dead ends: 9938 [2022-03-03 16:34:38,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:34:38,990 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 1639 mSDsluCounter, 10701 mSDsCounter, 0 mSdLazyCounter, 4056 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 11315 SdHoareTripleChecker+Invalid, 4089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:38,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1639 Valid, 11315 Invalid, 4089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4056 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:34:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9938 states. [2022-03-03 16:34:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9938 to 5489. [2022-03-03 16:34:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5489 states, 5486 states have (on average 2.0508567262121766) internal successors, (11251), 5488 states have internal predecessors, (11251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5489 states to 5489 states and 11251 transitions. [2022-03-03 16:34:39,072 INFO L78 Accepts]: Start accepts. Automaton has 5489 states and 11251 transitions. Word has length 99 [2022-03-03 16:34:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:39,073 INFO L470 AbstractCegarLoop]: Abstraction has 5489 states and 11251 transitions. [2022-03-03 16:34:39,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5489 states and 11251 transitions. [2022-03-03 16:34:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:39,077 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:39,077 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] [2022-03-03 16:34:39,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-03 16:34:39,077 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:39,079 INFO L85 PathProgramCache]: Analyzing trace with hash -891812207, now seen corresponding path program 31 times [2022-03-03 16:34:39,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:39,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500444640] [2022-03-03 16:34:39,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:39,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:39,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:39,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500444640] [2022-03-03 16:34:39,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500444640] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:39,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:39,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:34:39,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490592903] [2022-03-03 16:34:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:39,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:34:39,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:39,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:34:39,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:34:39,775 INFO L87 Difference]: Start difference. First operand 5489 states and 11251 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:44,499 INFO L93 Difference]: Finished difference Result 8031 states and 16485 transitions. [2022-03-03 16:34:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:44,508 INFO L225 Difference]: With dead ends: 8031 [2022-03-03 16:34:44,508 INFO L226 Difference]: Without dead ends: 8031 [2022-03-03 16:34:44,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:34:44,509 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 1653 mSDsluCounter, 9704 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 10286 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:44,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1653 Valid, 10286 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:34:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8031 states. [2022-03-03 16:34:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8031 to 5471. [2022-03-03 16:34:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5471 states, 5468 states have (on average 2.050658376005852) internal successors, (11213), 5470 states have internal predecessors, (11213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 11213 transitions. [2022-03-03 16:34:44,573 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 11213 transitions. Word has length 99 [2022-03-03 16:34:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:44,573 INFO L470 AbstractCegarLoop]: Abstraction has 5471 states and 11213 transitions. [2022-03-03 16:34:44,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 11213 transitions. [2022-03-03 16:34:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:44,578 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:44,578 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] [2022-03-03 16:34:44,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-03 16:34:44,578 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 718038743, now seen corresponding path program 32 times [2022-03-03 16:34:44,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:44,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131192897] [2022-03-03 16:34:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:44,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:45,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:45,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131192897] [2022-03-03 16:34:45,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131192897] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:45,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:45,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:34:45,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989865560] [2022-03-03 16:34:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:45,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:34:45,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:34:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:34:45,364 INFO L87 Difference]: Start difference. First operand 5471 states and 11213 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:49,844 INFO L93 Difference]: Finished difference Result 8053 states and 16546 transitions. [2022-03-03 16:34:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:49,852 INFO L225 Difference]: With dead ends: 8053 [2022-03-03 16:34:49,852 INFO L226 Difference]: Without dead ends: 8053 [2022-03-03 16:34:49,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:34:49,853 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 1582 mSDsluCounter, 8959 mSDsCounter, 0 mSdLazyCounter, 3484 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 9531 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:49,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 9531 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3484 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:34:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8053 states. [2022-03-03 16:34:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8053 to 5469. [2022-03-03 16:34:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5469 states, 5466 states have (on average 2.0506769118185146) internal successors, (11209), 5468 states have internal predecessors, (11209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 11209 transitions. [2022-03-03 16:34:49,910 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 11209 transitions. Word has length 99 [2022-03-03 16:34:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:49,910 INFO L470 AbstractCegarLoop]: Abstraction has 5469 states and 11209 transitions. [2022-03-03 16:34:49,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 11209 transitions. [2022-03-03 16:34:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:49,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:49,914 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] [2022-03-03 16:34:49,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-03 16:34:49,914 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1464411143, now seen corresponding path program 33 times [2022-03-03 16:34:49,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:49,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784370866] [2022-03-03 16:34:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:50,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:50,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784370866] [2022-03-03 16:34:50,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784370866] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:50,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:50,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:34:50,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48232968] [2022-03-03 16:34:50,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:50,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:34:50,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:50,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:34:50,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:34:50,684 INFO L87 Difference]: Start difference. First operand 5469 states and 11209 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:34:55,489 INFO L93 Difference]: Finished difference Result 8104 states and 16648 transitions. [2022-03-03 16:34:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:34:55,490 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:34:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:34:55,498 INFO L225 Difference]: With dead ends: 8104 [2022-03-03 16:34:55,498 INFO L226 Difference]: Without dead ends: 8104 [2022-03-03 16:34:55,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:34:55,499 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1549 mSDsluCounter, 9722 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 10293 SdHoareTripleChecker+Invalid, 3980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:34:55,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 10293 Invalid, 3980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:34:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2022-03-03 16:34:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 5465. [2022-03-03 16:34:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5465 states, 5462 states have (on average 2.0507140241669717) internal successors, (11201), 5464 states have internal predecessors, (11201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 11201 transitions. [2022-03-03 16:34:55,562 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 11201 transitions. Word has length 99 [2022-03-03 16:34:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:34:55,562 INFO L470 AbstractCegarLoop]: Abstraction has 5465 states and 11201 transitions. [2022-03-03 16:34:55,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:34:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 11201 transitions. [2022-03-03 16:34:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:34:55,567 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:34:55,567 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] [2022-03-03 16:34:55,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-03 16:34:55,567 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:34:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:34:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash 259071161, now seen corresponding path program 34 times [2022-03-03 16:34:55,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:34:55,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503042769] [2022-03-03 16:34:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:34:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:34:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:34:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:34:56,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:34:56,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503042769] [2022-03-03 16:34:56,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503042769] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:34:56,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:34:56,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:34:56,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776003172] [2022-03-03 16:34:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:34:56,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:34:56,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:34:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:34:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:34:56,398 INFO L87 Difference]: Start difference. First operand 5465 states and 11201 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:00,974 INFO L93 Difference]: Finished difference Result 7706 states and 15816 transitions. [2022-03-03 16:35:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:00,982 INFO L225 Difference]: With dead ends: 7706 [2022-03-03 16:35:00,982 INFO L226 Difference]: Without dead ends: 7706 [2022-03-03 16:35:00,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:00,982 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1580 mSDsluCounter, 9310 mSDsCounter, 0 mSdLazyCounter, 3760 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 9876 SdHoareTripleChecker+Invalid, 3795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:00,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 9876 Invalid, 3795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3760 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:35:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7706 states. [2022-03-03 16:35:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7706 to 5516. [2022-03-03 16:35:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5516 states, 5513 states have (on average 2.0502448757482314) internal successors, (11303), 5515 states have internal predecessors, (11303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5516 states to 5516 states and 11303 transitions. [2022-03-03 16:35:01,033 INFO L78 Accepts]: Start accepts. Automaton has 5516 states and 11303 transitions. Word has length 99 [2022-03-03 16:35:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:01,034 INFO L470 AbstractCegarLoop]: Abstraction has 5516 states and 11303 transitions. [2022-03-03 16:35:01,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5516 states and 11303 transitions. [2022-03-03 16:35:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:01,037 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:01,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:35:01,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-03 16:35:01,038 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1251499575, now seen corresponding path program 35 times [2022-03-03 16:35:01,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:01,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778040326] [2022-03-03 16:35:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:01,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:01,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778040326] [2022-03-03 16:35:01,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778040326] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:01,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:01,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:01,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929994755] [2022-03-03 16:35:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:01,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:01,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:01,959 INFO L87 Difference]: Start difference. First operand 5516 states and 11303 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:06,598 INFO L93 Difference]: Finished difference Result 8044 states and 16528 transitions. [2022-03-03 16:35:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:06,608 INFO L225 Difference]: With dead ends: 8044 [2022-03-03 16:35:06,608 INFO L226 Difference]: Without dead ends: 8044 [2022-03-03 16:35:06,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:06,609 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1547 mSDsluCounter, 10453 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 11024 SdHoareTripleChecker+Invalid, 3985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:06,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1547 Valid, 11024 Invalid, 3985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:35:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8044 states. [2022-03-03 16:35:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8044 to 5546. [2022-03-03 16:35:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5546 states, 5543 states have (on average 2.0503337542846833) internal successors, (11365), 5545 states have internal predecessors, (11365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 11365 transitions. [2022-03-03 16:35:06,681 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 11365 transitions. Word has length 99 [2022-03-03 16:35:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:06,681 INFO L470 AbstractCegarLoop]: Abstraction has 5546 states and 11365 transitions. [2022-03-03 16:35:06,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 11365 transitions. [2022-03-03 16:35:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:06,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:06,685 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] [2022-03-03 16:35:06,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-03 16:35:06,685 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1158856063, now seen corresponding path program 36 times [2022-03-03 16:35:06,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:06,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495191653] [2022-03-03 16:35:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:07,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:07,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495191653] [2022-03-03 16:35:07,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495191653] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:07,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:07,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:35:07,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328269062] [2022-03-03 16:35:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:07,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:35:07,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:07,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:35:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:35:07,396 INFO L87 Difference]: Start difference. First operand 5546 states and 11365 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:12,336 INFO L93 Difference]: Finished difference Result 10014 states and 20579 transitions. [2022-03-03 16:35:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:35:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:12,351 INFO L225 Difference]: With dead ends: 10014 [2022-03-03 16:35:12,352 INFO L226 Difference]: Without dead ends: 10014 [2022-03-03 16:35:12,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:35:12,352 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 1753 mSDsluCounter, 10768 mSDsCounter, 0 mSdLazyCounter, 3849 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 11385 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:12,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1753 Valid, 11385 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3849 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:35:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10014 states. [2022-03-03 16:35:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10014 to 5548. [2022-03-03 16:35:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5548 states, 5545 states have (on average 2.0503155996393145) internal successors, (11369), 5547 states have internal predecessors, (11369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 11369 transitions. [2022-03-03 16:35:12,430 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 11369 transitions. Word has length 99 [2022-03-03 16:35:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:12,430 INFO L470 AbstractCegarLoop]: Abstraction has 5548 states and 11369 transitions. [2022-03-03 16:35:12,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 11369 transitions. [2022-03-03 16:35:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:12,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:12,434 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] [2022-03-03 16:35:12,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-03 16:35:12,435 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1928941809, now seen corresponding path program 37 times [2022-03-03 16:35:12,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:12,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864589524] [2022-03-03 16:35:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:13,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:13,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864589524] [2022-03-03 16:35:13,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864589524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:13,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:13,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:13,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513102096] [2022-03-03 16:35:13,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:13,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:13,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:13,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:13,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:13,148 INFO L87 Difference]: Start difference. First operand 5548 states and 11369 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:17,631 INFO L93 Difference]: Finished difference Result 8107 states and 16637 transitions. [2022-03-03 16:35:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:17,632 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:17,641 INFO L225 Difference]: With dead ends: 8107 [2022-03-03 16:35:17,641 INFO L226 Difference]: Without dead ends: 8107 [2022-03-03 16:35:17,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:17,642 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1567 mSDsluCounter, 9263 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 9848 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:17,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1567 Valid, 9848 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:35:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8107 states. [2022-03-03 16:35:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8107 to 5530. [2022-03-03 16:35:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5530 states, 5527 states have (on average 2.0501176044870637) internal successors, (11331), 5529 states have internal predecessors, (11331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 11331 transitions. [2022-03-03 16:35:17,705 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 11331 transitions. Word has length 99 [2022-03-03 16:35:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:17,705 INFO L470 AbstractCegarLoop]: Abstraction has 5530 states and 11331 transitions. [2022-03-03 16:35:17,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 11331 transitions. [2022-03-03 16:35:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:17,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:17,709 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] [2022-03-03 16:35:17,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-03 16:35:17,710 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash -319090859, now seen corresponding path program 38 times [2022-03-03 16:35:17,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:17,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797190998] [2022-03-03 16:35:17,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:17,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:18,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:18,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797190998] [2022-03-03 16:35:18,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797190998] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:18,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:18,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:18,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431626054] [2022-03-03 16:35:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:18,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:18,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:18,538 INFO L87 Difference]: Start difference. First operand 5530 states and 11331 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:23,245 INFO L93 Difference]: Finished difference Result 8129 states and 16698 transitions. [2022-03-03 16:35:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:23,254 INFO L225 Difference]: With dead ends: 8129 [2022-03-03 16:35:23,254 INFO L226 Difference]: Without dead ends: 8129 [2022-03-03 16:35:23,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:23,254 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 1561 mSDsluCounter, 9740 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 10315 SdHoareTripleChecker+Invalid, 3729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:23,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1561 Valid, 10315 Invalid, 3729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3695 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:35:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2022-03-03 16:35:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 5528. [2022-03-03 16:35:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5528 states, 5525 states have (on average 2.050135746606335) internal successors, (11327), 5527 states have internal predecessors, (11327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5528 states to 5528 states and 11327 transitions. [2022-03-03 16:35:23,313 INFO L78 Accepts]: Start accepts. Automaton has 5528 states and 11327 transitions. Word has length 99 [2022-03-03 16:35:23,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:23,314 INFO L470 AbstractCegarLoop]: Abstraction has 5528 states and 11327 transitions. [2022-03-03 16:35:23,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5528 states and 11327 transitions. [2022-03-03 16:35:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:23,318 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:23,318 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] [2022-03-03 16:35:23,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-03 16:35:23,318 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1793426551, now seen corresponding path program 39 times [2022-03-03 16:35:23,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:23,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316626207] [2022-03-03 16:35:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:24,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:24,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316626207] [2022-03-03 16:35:24,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316626207] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:24,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:24,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:24,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819095656] [2022-03-03 16:35:24,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:24,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:24,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:24,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:24,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:24,092 INFO L87 Difference]: Start difference. First operand 5528 states and 11327 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:28,744 INFO L93 Difference]: Finished difference Result 8180 states and 16800 transitions. [2022-03-03 16:35:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:28,752 INFO L225 Difference]: With dead ends: 8180 [2022-03-03 16:35:28,752 INFO L226 Difference]: Without dead ends: 8180 [2022-03-03 16:35:28,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:28,753 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1493 mSDsluCounter, 10489 mSDsCounter, 0 mSdLazyCounter, 4055 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 11063 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:28,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1493 Valid, 11063 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4055 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:35:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2022-03-03 16:35:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 5524. [2022-03-03 16:35:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5521 states have (on average 2.0501720702771236) internal successors, (11319), 5523 states have internal predecessors, (11319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 11319 transitions. [2022-03-03 16:35:28,804 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 11319 transitions. Word has length 99 [2022-03-03 16:35:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:28,804 INFO L470 AbstractCegarLoop]: Abstraction has 5524 states and 11319 transitions. [2022-03-03 16:35:28,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 11319 transitions. [2022-03-03 16:35:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:28,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:28,808 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] [2022-03-03 16:35:28,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-03 16:35:28,808 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -778058441, now seen corresponding path program 40 times [2022-03-03 16:35:28,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:28,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867686346] [2022-03-03 16:35:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:29,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:29,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867686346] [2022-03-03 16:35:29,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867686346] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:29,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:29,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:29,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927578512] [2022-03-03 16:35:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:29,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:29,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:29,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:29,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:29,578 INFO L87 Difference]: Start difference. First operand 5524 states and 11319 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:34,099 INFO L93 Difference]: Finished difference Result 8265 states and 16970 transitions. [2022-03-03 16:35:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:34,100 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:34,108 INFO L225 Difference]: With dead ends: 8265 [2022-03-03 16:35:34,108 INFO L226 Difference]: Without dead ends: 8265 [2022-03-03 16:35:34,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:34,110 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 1539 mSDsluCounter, 9511 mSDsCounter, 0 mSdLazyCounter, 3668 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 10089 SdHoareTripleChecker+Invalid, 3700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:34,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1539 Valid, 10089 Invalid, 3700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3668 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:35:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2022-03-03 16:35:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 5518. [2022-03-03 16:35:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5518 states, 5515 states have (on average 2.0502266545784225) internal successors, (11307), 5517 states have internal predecessors, (11307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 11307 transitions. [2022-03-03 16:35:34,162 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 11307 transitions. Word has length 99 [2022-03-03 16:35:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:34,162 INFO L470 AbstractCegarLoop]: Abstraction has 5518 states and 11307 transitions. [2022-03-03 16:35:34,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 11307 transitions. [2022-03-03 16:35:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:34,165 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:34,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:35:34,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-03 16:35:34,166 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2006609387, now seen corresponding path program 41 times [2022-03-03 16:35:34,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:34,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419101792] [2022-03-03 16:35:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:34,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:34,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419101792] [2022-03-03 16:35:34,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419101792] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:34,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:34,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:34,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276994817] [2022-03-03 16:35:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:34,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:34,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:34,920 INFO L87 Difference]: Start difference. First operand 5518 states and 11307 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:39,265 INFO L93 Difference]: Finished difference Result 7776 states and 15956 transitions. [2022-03-03 16:35:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:39,275 INFO L225 Difference]: With dead ends: 7776 [2022-03-03 16:35:39,275 INFO L226 Difference]: Without dead ends: 7776 [2022-03-03 16:35:39,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:39,276 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 1602 mSDsluCounter, 8353 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:39,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1602 Valid, 8922 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 16:35:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2022-03-03 16:35:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 5535. [2022-03-03 16:35:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5532 states have (on average 2.050072306579899) internal successors, (11341), 5534 states have internal predecessors, (11341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 11341 transitions. [2022-03-03 16:35:39,333 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 11341 transitions. Word has length 99 [2022-03-03 16:35:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:39,333 INFO L470 AbstractCegarLoop]: Abstraction has 5535 states and 11341 transitions. [2022-03-03 16:35:39,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 11341 transitions. [2022-03-03 16:35:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:39,337 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:39,337 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] [2022-03-03 16:35:39,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-03 16:35:39,337 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1348039269, now seen corresponding path program 42 times [2022-03-03 16:35:39,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:39,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965216275] [2022-03-03 16:35:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:40,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:40,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965216275] [2022-03-03 16:35:40,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965216275] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:40,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:40,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:40,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408563718] [2022-03-03 16:35:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:40,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:40,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:40,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:40,136 INFO L87 Difference]: Start difference. First operand 5535 states and 11341 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:44,913 INFO L93 Difference]: Finished difference Result 8082 states and 16604 transitions. [2022-03-03 16:35:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:44,921 INFO L225 Difference]: With dead ends: 8082 [2022-03-03 16:35:44,921 INFO L226 Difference]: Without dead ends: 8082 [2022-03-03 16:35:44,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:44,922 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1567 mSDsluCounter, 9851 mSDsCounter, 0 mSdLazyCounter, 3822 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 10424 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:44,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1567 Valid, 10424 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3822 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:35:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8082 states. [2022-03-03 16:35:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8082 to 5567. [2022-03-03 16:35:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5567 states, 5564 states have (on average 2.0501437814521926) internal successors, (11407), 5566 states have internal predecessors, (11407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 11407 transitions. [2022-03-03 16:35:44,979 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 11407 transitions. Word has length 99 [2022-03-03 16:35:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:44,979 INFO L470 AbstractCegarLoop]: Abstraction has 5567 states and 11407 transitions. [2022-03-03 16:35:44,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 11407 transitions. [2022-03-03 16:35:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:44,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:44,984 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] [2022-03-03 16:35:44,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-03 16:35:44,984 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1255395757, now seen corresponding path program 43 times [2022-03-03 16:35:44,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:44,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796929966] [2022-03-03 16:35:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:45,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:45,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796929966] [2022-03-03 16:35:45,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796929966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:45,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:45,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:45,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033426997] [2022-03-03 16:35:45,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:45,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:45,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:45,715 INFO L87 Difference]: Start difference. First operand 5567 states and 11407 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:50,650 INFO L93 Difference]: Finished difference Result 10052 states and 20655 transitions. [2022-03-03 16:35:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:35:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:50,662 INFO L225 Difference]: With dead ends: 10052 [2022-03-03 16:35:50,662 INFO L226 Difference]: Without dead ends: 10052 [2022-03-03 16:35:50,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:35:50,662 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 1800 mSDsluCounter, 10046 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 10665 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:50,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1800 Valid, 10665 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3710 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:35:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10052 states. [2022-03-03 16:35:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10052 to 5569. [2022-03-03 16:35:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5569 states, 5566 states have (on average 2.0501257635644987) internal successors, (11411), 5568 states have internal predecessors, (11411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 11411 transitions. [2022-03-03 16:35:50,727 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 11411 transitions. Word has length 99 [2022-03-03 16:35:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:50,727 INFO L470 AbstractCegarLoop]: Abstraction has 5569 states and 11411 transitions. [2022-03-03 16:35:50,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 11411 transitions. [2022-03-03 16:35:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:50,731 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:50,731 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] [2022-03-03 16:35:50,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-03 16:35:50,732 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1832402115, now seen corresponding path program 44 times [2022-03-03 16:35:50,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:50,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848171261] [2022-03-03 16:35:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:51,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:51,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848171261] [2022-03-03 16:35:51,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848171261] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:51,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:51,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:51,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388500119] [2022-03-03 16:35:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:51,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:51,467 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:51,468 INFO L87 Difference]: Start difference. First operand 5569 states and 11411 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:35:56,465 INFO L93 Difference]: Finished difference Result 8145 states and 16713 transitions. [2022-03-03 16:35:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:35:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:35:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:35:56,474 INFO L225 Difference]: With dead ends: 8145 [2022-03-03 16:35:56,474 INFO L226 Difference]: Without dead ends: 8145 [2022-03-03 16:35:56,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:35:56,475 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 1524 mSDsluCounter, 11039 mSDsCounter, 0 mSdLazyCounter, 4188 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 11626 SdHoareTripleChecker+Invalid, 4222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:35:56,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 11626 Invalid, 4222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4188 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:35:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8145 states. [2022-03-03 16:35:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8145 to 5551. [2022-03-03 16:35:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5551 states, 5548 states have (on average 2.0499279019466474) internal successors, (11373), 5550 states have internal predecessors, (11373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 11373 transitions. [2022-03-03 16:35:56,538 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 11373 transitions. Word has length 99 [2022-03-03 16:35:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:35:56,538 INFO L470 AbstractCegarLoop]: Abstraction has 5551 states and 11373 transitions. [2022-03-03 16:35:56,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:35:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 11373 transitions. [2022-03-03 16:35:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:35:56,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:35:56,543 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] [2022-03-03 16:35:56,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-03 16:35:56,543 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:35:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:35:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -222551165, now seen corresponding path program 45 times [2022-03-03 16:35:56,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:35:56,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701838569] [2022-03-03 16:35:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:35:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:35:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:35:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:35:57,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:35:57,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701838569] [2022-03-03 16:35:57,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701838569] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:35:57,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:35:57,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:35:57,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144432475] [2022-03-03 16:35:57,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:35:57,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:35:57,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:35:57,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:35:57,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:35:57,317 INFO L87 Difference]: Start difference. First operand 5551 states and 11373 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:01,965 INFO L93 Difference]: Finished difference Result 8167 states and 16774 transitions. [2022-03-03 16:36:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:01,974 INFO L225 Difference]: With dead ends: 8167 [2022-03-03 16:36:01,974 INFO L226 Difference]: Without dead ends: 8167 [2022-03-03 16:36:01,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:36:01,975 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1610 mSDsluCounter, 9206 mSDsCounter, 0 mSdLazyCounter, 3546 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 9783 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:01,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1610 Valid, 9783 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3546 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:36:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2022-03-03 16:36:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 5549. [2022-03-03 16:36:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5549 states, 5546 states have (on average 2.0499459069599713) internal successors, (11369), 5548 states have internal predecessors, (11369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 11369 transitions. [2022-03-03 16:36:02,041 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 11369 transitions. Word has length 99 [2022-03-03 16:36:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:02,042 INFO L470 AbstractCegarLoop]: Abstraction has 5549 states and 11369 transitions. [2022-03-03 16:36:02,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 11369 transitions. [2022-03-03 16:36:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:02,046 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:02,046 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] [2022-03-03 16:36:02,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-03 16:36:02,046 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1889966245, now seen corresponding path program 46 times [2022-03-03 16:36:02,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:02,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298968913] [2022-03-03 16:36:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:02,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:02,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298968913] [2022-03-03 16:36:02,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298968913] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:02,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:02,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:36:02,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023179959] [2022-03-03 16:36:02,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:02,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:36:02,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:36:02,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:36:02,840 INFO L87 Difference]: Start difference. First operand 5549 states and 11369 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:07,641 INFO L93 Difference]: Finished difference Result 8218 states and 16876 transitions. [2022-03-03 16:36:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:07,650 INFO L225 Difference]: With dead ends: 8218 [2022-03-03 16:36:07,650 INFO L226 Difference]: Without dead ends: 8218 [2022-03-03 16:36:07,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:36:07,651 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1552 mSDsluCounter, 10146 mSDsCounter, 0 mSdLazyCounter, 3935 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 10722 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:07,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1552 Valid, 10722 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3935 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:36:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2022-03-03 16:36:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 5545. [2022-03-03 16:36:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5545 states, 5542 states have (on average 2.049981955972573) internal successors, (11361), 5544 states have internal predecessors, (11361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 11361 transitions. [2022-03-03 16:36:07,708 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 11361 transitions. Word has length 99 [2022-03-03 16:36:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:07,708 INFO L470 AbstractCegarLoop]: Abstraction has 5545 states and 11361 transitions. [2022-03-03 16:36:07,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 11361 transitions. [2022-03-03 16:36:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:07,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:07,712 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] [2022-03-03 16:36:07,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-03 16:36:07,713 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -681518747, now seen corresponding path program 47 times [2022-03-03 16:36:07,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:07,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448648405] [2022-03-03 16:36:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:08,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:08,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448648405] [2022-03-03 16:36:08,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448648405] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:08,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:08,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:36:08,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537751777] [2022-03-03 16:36:08,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:08,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:36:08,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:08,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:36:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:36:08,525 INFO L87 Difference]: Start difference. First operand 5545 states and 11361 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:13,124 INFO L93 Difference]: Finished difference Result 8303 states and 17046 transitions. [2022-03-03 16:36:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:13,134 INFO L225 Difference]: With dead ends: 8303 [2022-03-03 16:36:13,134 INFO L226 Difference]: Without dead ends: 8303 [2022-03-03 16:36:13,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:36:13,135 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1625 mSDsluCounter, 9947 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 10527 SdHoareTripleChecker+Invalid, 3738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:13,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1625 Valid, 10527 Invalid, 3738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:36:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2022-03-03 16:36:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 5539. [2022-03-03 16:36:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5539 states, 5536 states have (on average 2.05003612716763) internal successors, (11349), 5538 states have internal predecessors, (11349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 11349 transitions. [2022-03-03 16:36:13,219 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 11349 transitions. Word has length 99 [2022-03-03 16:36:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:13,219 INFO L470 AbstractCegarLoop]: Abstraction has 5539 states and 11349 transitions. [2022-03-03 16:36:13,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 11349 transitions. [2022-03-03 16:36:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:13,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:13,231 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] [2022-03-03 16:36:13,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-03 16:36:13,231 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1910069693, now seen corresponding path program 48 times [2022-03-03 16:36:13,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:13,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075166920] [2022-03-03 16:36:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:14,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:14,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075166920] [2022-03-03 16:36:14,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075166920] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:14,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:14,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:36:14,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176189459] [2022-03-03 16:36:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:14,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:36:14,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:36:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:36:14,020 INFO L87 Difference]: Start difference. First operand 5539 states and 11349 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:18,780 INFO L93 Difference]: Finished difference Result 8371 states and 17182 transitions. [2022-03-03 16:36:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:18,780 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:18,789 INFO L225 Difference]: With dead ends: 8371 [2022-03-03 16:36:18,789 INFO L226 Difference]: Without dead ends: 8371 [2022-03-03 16:36:18,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:36:18,790 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 1549 mSDsluCounter, 10283 mSDsCounter, 0 mSdLazyCounter, 4013 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 10865 SdHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:18,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 10865 Invalid, 4044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4013 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:36:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8371 states. [2022-03-03 16:36:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8371 to 5537. [2022-03-03 16:36:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5537 states, 5534 states have (on average 2.050054210336104) internal successors, (11345), 5536 states have internal predecessors, (11345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5537 states to 5537 states and 11345 transitions. [2022-03-03 16:36:18,848 INFO L78 Accepts]: Start accepts. Automaton has 5537 states and 11345 transitions. Word has length 99 [2022-03-03 16:36:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:18,849 INFO L470 AbstractCegarLoop]: Abstraction has 5537 states and 11345 transitions. [2022-03-03 16:36:18,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5537 states and 11345 transitions. [2022-03-03 16:36:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:18,852 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:18,852 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] [2022-03-03 16:36:18,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-03 16:36:18,853 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:18,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1959007845, now seen corresponding path program 49 times [2022-03-03 16:36:18,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:18,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311078663] [2022-03-03 16:36:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:19,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:19,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311078663] [2022-03-03 16:36:19,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311078663] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:19,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:19,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-03-03 16:36:19,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71987814] [2022-03-03 16:36:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:19,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-03 16:36:19,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:19,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-03 16:36:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 16:36:19,793 INFO L87 Difference]: Start difference. First operand 5537 states and 11345 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:25,292 INFO L93 Difference]: Finished difference Result 8485 states and 17418 transitions. [2022-03-03 16:36:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-03 16:36:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:25,302 INFO L225 Difference]: With dead ends: 8485 [2022-03-03 16:36:25,303 INFO L226 Difference]: Without dead ends: 8485 [2022-03-03 16:36:25,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1130, Invalid=5676, Unknown=0, NotChecked=0, Total=6806 [2022-03-03 16:36:25,303 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1719 mSDsluCounter, 9939 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 10513 SdHoareTripleChecker+Invalid, 3809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:25,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1719 Valid, 10513 Invalid, 3809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:36:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8485 states. [2022-03-03 16:36:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8485 to 5921. [2022-03-03 16:36:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5921 states, 5918 states have (on average 2.052889489692464) internal successors, (12149), 5920 states have internal predecessors, (12149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5921 states to 5921 states and 12149 transitions. [2022-03-03 16:36:25,369 INFO L78 Accepts]: Start accepts. Automaton has 5921 states and 12149 transitions. Word has length 99 [2022-03-03 16:36:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:25,369 INFO L470 AbstractCegarLoop]: Abstraction has 5921 states and 12149 transitions. [2022-03-03 16:36:25,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5921 states and 12149 transitions. [2022-03-03 16:36:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:25,374 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:25,374 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] [2022-03-03 16:36:25,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-03 16:36:25,374 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:25,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1233893471, now seen corresponding path program 50 times [2022-03-03 16:36:25,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:25,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483542089] [2022-03-03 16:36:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:26,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:26,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483542089] [2022-03-03 16:36:26,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483542089] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:26,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:26,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:36:26,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706905948] [2022-03-03 16:36:26,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:26,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:36:26,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:36:26,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:36:26,168 INFO L87 Difference]: Start difference. First operand 5921 states and 12149 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:30,899 INFO L93 Difference]: Finished difference Result 9287 states and 19072 transitions. [2022-03-03 16:36:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:30,899 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:30,910 INFO L225 Difference]: With dead ends: 9287 [2022-03-03 16:36:30,910 INFO L226 Difference]: Without dead ends: 9287 [2022-03-03 16:36:30,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:36:30,911 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1529 mSDsluCounter, 10444 mSDsCounter, 0 mSdLazyCounter, 3998 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 11014 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:30,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 11014 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3998 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:36:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9287 states. [2022-03-03 16:36:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9287 to 5554. [2022-03-03 16:36:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5554 states, 5551 states have (on average 2.049900918753378) internal successors, (11379), 5553 states have internal predecessors, (11379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5554 states to 5554 states and 11379 transitions. [2022-03-03 16:36:30,987 INFO L78 Accepts]: Start accepts. Automaton has 5554 states and 11379 transitions. Word has length 99 [2022-03-03 16:36:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:30,987 INFO L470 AbstractCegarLoop]: Abstraction has 5554 states and 11379 transitions. [2022-03-03 16:36:30,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5554 states and 11379 transitions. [2022-03-03 16:36:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:30,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:30,991 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] [2022-03-03 16:36:30,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-03 16:36:30,991 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1893386159, now seen corresponding path program 51 times [2022-03-03 16:36:30,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:30,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525863225] [2022-03-03 16:36:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:31,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:31,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525863225] [2022-03-03 16:36:31,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525863225] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:31,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:31,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:36:31,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765666220] [2022-03-03 16:36:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:31,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:36:31,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:36:31,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:36:31,764 INFO L87 Difference]: Start difference. First operand 5554 states and 11379 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:36,481 INFO L93 Difference]: Finished difference Result 7778 states and 15977 transitions. [2022-03-03 16:36:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:36,490 INFO L225 Difference]: With dead ends: 7778 [2022-03-03 16:36:36,490 INFO L226 Difference]: Without dead ends: 7778 [2022-03-03 16:36:36,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:36:36,493 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1875 mSDsluCounter, 9605 mSDsCounter, 0 mSdLazyCounter, 3672 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 10181 SdHoareTripleChecker+Invalid, 3718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:36,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1875 Valid, 10181 Invalid, 3718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3672 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:36:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7778 states. [2022-03-03 16:36:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7778 to 5592. [2022-03-03 16:36:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5592 states, 5589 states have (on average 2.0499194847020936) internal successors, (11457), 5591 states have internal predecessors, (11457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5592 states to 5592 states and 11457 transitions. [2022-03-03 16:36:36,579 INFO L78 Accepts]: Start accepts. Automaton has 5592 states and 11457 transitions. Word has length 99 [2022-03-03 16:36:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:36,579 INFO L470 AbstractCegarLoop]: Abstraction has 5592 states and 11457 transitions. [2022-03-03 16:36:36,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 11457 transitions. [2022-03-03 16:36:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:36,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:36,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] [2022-03-03 16:36:36,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-03 16:36:36,583 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:36,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1986029671, now seen corresponding path program 52 times [2022-03-03 16:36:36,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:36,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848372840] [2022-03-03 16:36:36,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:36,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:37,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:37,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848372840] [2022-03-03 16:36:37,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848372840] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:37,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:37,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-03-03 16:36:37,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702385390] [2022-03-03 16:36:37,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:37,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-03 16:36:37,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-03 16:36:37,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2022-03-03 16:36:37,356 INFO L87 Difference]: Start difference. First operand 5592 states and 11457 transitions. Second operand has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 35 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:43,814 INFO L93 Difference]: Finished difference Result 9893 states and 20323 transitions. [2022-03-03 16:36:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-03 16:36:43,815 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 35 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:43,825 INFO L225 Difference]: With dead ends: 9893 [2022-03-03 16:36:43,825 INFO L226 Difference]: Without dead ends: 9893 [2022-03-03 16:36:43,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1416, Invalid=6416, Unknown=0, NotChecked=0, Total=7832 [2022-03-03 16:36:43,826 INFO L933 BasicCegarLoop]: 671 mSDtfsCounter, 1988 mSDsluCounter, 13235 mSDsCounter, 0 mSdLazyCounter, 4933 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 13906 SdHoareTripleChecker+Invalid, 4981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:43,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1988 Valid, 13906 Invalid, 4981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4933 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-03 16:36:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9893 states. [2022-03-03 16:36:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9893 to 5594. [2022-03-03 16:36:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5594 states, 5591 states have (on average 2.049901627615811) internal successors, (11461), 5593 states have internal predecessors, (11461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5594 states to 5594 states and 11461 transitions. [2022-03-03 16:36:43,896 INFO L78 Accepts]: Start accepts. Automaton has 5594 states and 11461 transitions. Word has length 99 [2022-03-03 16:36:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:43,897 INFO L470 AbstractCegarLoop]: Abstraction has 5594 states and 11461 transitions. [2022-03-03 16:36:43,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 35 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5594 states and 11461 transitions. [2022-03-03 16:36:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:43,901 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:43,901 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] [2022-03-03 16:36:43,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-03 16:36:43,901 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash -778860247, now seen corresponding path program 53 times [2022-03-03 16:36:43,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:43,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882285712] [2022-03-03 16:36:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:44,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:44,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882285712] [2022-03-03 16:36:44,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882285712] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:44,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:44,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:36:44,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814526263] [2022-03-03 16:36:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:44,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:36:44,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:36:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:36:44,598 INFO L87 Difference]: Start difference. First operand 5594 states and 11461 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:49,247 INFO L93 Difference]: Finished difference Result 7841 states and 16086 transitions. [2022-03-03 16:36:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:49,256 INFO L225 Difference]: With dead ends: 7841 [2022-03-03 16:36:49,257 INFO L226 Difference]: Without dead ends: 7841 [2022-03-03 16:36:49,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:36:49,257 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1542 mSDsluCounter, 9599 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 10189 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:49,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1542 Valid, 10189 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:36:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7841 states. [2022-03-03 16:36:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7841 to 5576. [2022-03-03 16:36:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5576 states, 5573 states have (on average 2.049703929660865) internal successors, (11423), 5575 states have internal predecessors, (11423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5576 states to 5576 states and 11423 transitions. [2022-03-03 16:36:49,332 INFO L78 Accepts]: Start accepts. Automaton has 5576 states and 11423 transitions. Word has length 99 [2022-03-03 16:36:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:49,333 INFO L470 AbstractCegarLoop]: Abstraction has 5576 states and 11423 transitions. [2022-03-03 16:36:49,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 5576 states and 11423 transitions. [2022-03-03 16:36:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:49,338 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:49,338 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] [2022-03-03 16:36:49,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-03 16:36:49,338 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash 830990703, now seen corresponding path program 54 times [2022-03-03 16:36:49,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:49,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329013229] [2022-03-03 16:36:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:50,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:50,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329013229] [2022-03-03 16:36:50,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329013229] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:50,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:50,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:36:50,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694471058] [2022-03-03 16:36:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:50,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:36:50,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:36:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:36:50,110 INFO L87 Difference]: Start difference. First operand 5576 states and 11423 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:36:54,768 INFO L93 Difference]: Finished difference Result 7863 states and 16147 transitions. [2022-03-03 16:36:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:36:54,768 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:36:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:36:54,776 INFO L225 Difference]: With dead ends: 7863 [2022-03-03 16:36:54,776 INFO L226 Difference]: Without dead ends: 7863 [2022-03-03 16:36:54,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:36:54,777 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1723 mSDsluCounter, 9161 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 9741 SdHoareTripleChecker+Invalid, 3519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:36:54,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1723 Valid, 9741 Invalid, 3519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3482 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:36:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2022-03-03 16:36:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 5574. [2022-03-03 16:36:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5574 states, 5571 states have (on average 2.049721773469754) internal successors, (11419), 5573 states have internal predecessors, (11419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5574 states to 5574 states and 11419 transitions. [2022-03-03 16:36:54,835 INFO L78 Accepts]: Start accepts. Automaton has 5574 states and 11419 transitions. Word has length 99 [2022-03-03 16:36:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:36:54,836 INFO L470 AbstractCegarLoop]: Abstraction has 5574 states and 11419 transitions. [2022-03-03 16:36:54,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:36:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5574 states and 11419 transitions. [2022-03-03 16:36:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:36:54,840 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:36:54,840 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] [2022-03-03 16:36:54,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-03-03 16:36:54,840 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:36:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:36:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1351459183, now seen corresponding path program 55 times [2022-03-03 16:36:54,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:36:54,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525634019] [2022-03-03 16:36:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:36:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:36:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:36:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:36:55,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:36:55,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525634019] [2022-03-03 16:36:55,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525634019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:36:55,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:36:55,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:36:55,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411227613] [2022-03-03 16:36:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:36:55,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:36:55,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:36:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:36:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:36:55,601 INFO L87 Difference]: Start difference. First operand 5574 states and 11419 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:00,288 INFO L93 Difference]: Finished difference Result 7914 states and 16249 transitions. [2022-03-03 16:37:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:37:00,289 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:00,298 INFO L225 Difference]: With dead ends: 7914 [2022-03-03 16:37:00,298 INFO L226 Difference]: Without dead ends: 7914 [2022-03-03 16:37:00,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:37:00,299 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1590 mSDsluCounter, 9573 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 10152 SdHoareTripleChecker+Invalid, 3680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:00,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1590 Valid, 10152 Invalid, 3680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:37:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2022-03-03 16:37:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 5570. [2022-03-03 16:37:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5567 states have (on average 2.049757499550925) internal successors, (11411), 5569 states have internal predecessors, (11411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 11411 transitions. [2022-03-03 16:37:00,374 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 11411 transitions. Word has length 99 [2022-03-03 16:37:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:00,375 INFO L470 AbstractCegarLoop]: Abstraction has 5570 states and 11411 transitions. [2022-03-03 16:37:00,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 11411 transitions. [2022-03-03 16:37:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:00,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:00,379 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] [2022-03-03 16:37:00,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-03-03 16:37:00,379 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 372023121, now seen corresponding path program 56 times [2022-03-03 16:37:00,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:00,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342645227] [2022-03-03 16:37:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:01,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:01,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342645227] [2022-03-03 16:37:01,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342645227] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:01,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:01,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:37:01,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664125999] [2022-03-03 16:37:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:01,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:37:01,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:37:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:37:01,170 INFO L87 Difference]: Start difference. First operand 5570 states and 11411 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:05,902 INFO L93 Difference]: Finished difference Result 7999 states and 16419 transitions. [2022-03-03 16:37:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:37:05,902 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:05,911 INFO L225 Difference]: With dead ends: 7999 [2022-03-03 16:37:05,911 INFO L226 Difference]: Without dead ends: 7999 [2022-03-03 16:37:05,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:37:05,912 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 1849 mSDsluCounter, 9608 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 10191 SdHoareTripleChecker+Invalid, 3756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:05,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1849 Valid, 10191 Invalid, 3756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3711 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:37:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7999 states. [2022-03-03 16:37:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7999 to 5564. [2022-03-03 16:37:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5564 states, 5561 states have (on average 2.049811185038662) internal successors, (11399), 5563 states have internal predecessors, (11399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 11399 transitions. [2022-03-03 16:37:05,973 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 11399 transitions. Word has length 99 [2022-03-03 16:37:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:05,974 INFO L470 AbstractCegarLoop]: Abstraction has 5564 states and 11399 transitions. [2022-03-03 16:37:05,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 11399 transitions. [2022-03-03 16:37:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:05,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:05,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:37:05,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-03-03 16:37:05,978 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash -856527825, now seen corresponding path program 57 times [2022-03-03 16:37:05,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:05,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773602063] [2022-03-03 16:37:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:07,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:07,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773602063] [2022-03-03 16:37:07,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773602063] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:07,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:07,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-03-03 16:37:07,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661422441] [2022-03-03 16:37:07,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:07,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-03 16:37:07,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-03 16:37:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 16:37:07,057 INFO L87 Difference]: Start difference. First operand 5564 states and 11399 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:13,479 INFO L93 Difference]: Finished difference Result 9103 states and 18715 transitions. [2022-03-03 16:37:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-03 16:37:13,480 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:13,490 INFO L225 Difference]: With dead ends: 9103 [2022-03-03 16:37:13,490 INFO L226 Difference]: Without dead ends: 9103 [2022-03-03 16:37:13,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1404, Invalid=7152, Unknown=0, NotChecked=0, Total=8556 [2022-03-03 16:37:13,491 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 1995 mSDsluCounter, 10400 mSDsCounter, 0 mSdLazyCounter, 4155 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 10989 SdHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:13,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1995 Valid, 10989 Invalid, 4205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4155 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:37:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9103 states. [2022-03-03 16:37:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9103 to 5931. [2022-03-03 16:37:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5931 states, 5928 states have (on average 2.052800269905533) internal successors, (12169), 5930 states have internal predecessors, (12169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 12169 transitions. [2022-03-03 16:37:13,560 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 12169 transitions. Word has length 99 [2022-03-03 16:37:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:13,561 INFO L470 AbstractCegarLoop]: Abstraction has 5931 states and 12169 transitions. [2022-03-03 16:37:13,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 12169 transitions. [2022-03-03 16:37:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:13,565 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:13,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:37:13,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-03-03 16:37:13,565 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash 245538155, now seen corresponding path program 58 times [2022-03-03 16:37:13,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:13,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130381414] [2022-03-03 16:37:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:13,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:14,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:14,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130381414] [2022-03-03 16:37:14,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130381414] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:14,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:14,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:37:14,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956078556] [2022-03-03 16:37:14,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:14,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:37:14,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:37:14,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:37:14,372 INFO L87 Difference]: Start difference. First operand 5931 states and 12169 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:18,940 INFO L93 Difference]: Finished difference Result 9542 states and 19599 transitions. [2022-03-03 16:37:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:37:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:18,953 INFO L225 Difference]: With dead ends: 9542 [2022-03-03 16:37:18,953 INFO L226 Difference]: Without dead ends: 9542 [2022-03-03 16:37:18,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:37:18,954 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1616 mSDsluCounter, 9315 mSDsCounter, 0 mSdLazyCounter, 3635 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 9900 SdHoareTripleChecker+Invalid, 3667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:18,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1616 Valid, 9900 Invalid, 3667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3635 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:37:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9542 states. [2022-03-03 16:37:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9542 to 5562. [2022-03-03 16:37:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5562 states, 5559 states have (on average 2.0498291059543083) internal successors, (11395), 5561 states have internal predecessors, (11395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 11395 transitions. [2022-03-03 16:37:19,016 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 11395 transitions. Word has length 99 [2022-03-03 16:37:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:19,016 INFO L470 AbstractCegarLoop]: Abstraction has 5562 states and 11395 transitions. [2022-03-03 16:37:19,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 11395 transitions. [2022-03-03 16:37:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:19,020 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:19,020 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] [2022-03-03 16:37:19,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-03-03 16:37:19,020 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1282417583, now seen corresponding path program 59 times [2022-03-03 16:37:19,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:19,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072292881] [2022-03-03 16:37:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:19,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:19,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072292881] [2022-03-03 16:37:19,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072292881] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:19,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:19,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:37:19,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104876993] [2022-03-03 16:37:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:19,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:37:19,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:19,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:37:19,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:37:19,799 INFO L87 Difference]: Start difference. First operand 5562 states and 11395 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:24,345 INFO L93 Difference]: Finished difference Result 8101 states and 16623 transitions. [2022-03-03 16:37:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:37:24,345 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:24,353 INFO L225 Difference]: With dead ends: 8101 [2022-03-03 16:37:24,353 INFO L226 Difference]: Without dead ends: 8101 [2022-03-03 16:37:24,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:37:24,355 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 1588 mSDsluCounter, 9987 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 10573 SdHoareTripleChecker+Invalid, 3751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:24,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1588 Valid, 10573 Invalid, 3751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:37:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2022-03-03 16:37:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 5560. [2022-03-03 16:37:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 5557 states have (on average 2.0498470397696598) internal successors, (11391), 5559 states have internal predecessors, (11391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 11391 transitions. [2022-03-03 16:37:24,425 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 11391 transitions. Word has length 99 [2022-03-03 16:37:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:24,425 INFO L470 AbstractCegarLoop]: Abstraction has 5560 states and 11391 transitions. [2022-03-03 16:37:24,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 11391 transitions. [2022-03-03 16:37:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:24,430 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:24,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:37:24,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-03-03 16:37:24,431 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1718301777, now seen corresponding path program 60 times [2022-03-03 16:37:24,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:24,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366082217] [2022-03-03 16:37:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:25,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:25,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366082217] [2022-03-03 16:37:25,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366082217] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:25,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:25,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:37:25,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339498518] [2022-03-03 16:37:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:25,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:37:25,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:37:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:37:25,222 INFO L87 Difference]: Start difference. First operand 5560 states and 11391 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:29,795 INFO L93 Difference]: Finished difference Result 7506 states and 15397 transitions. [2022-03-03 16:37:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:37:29,795 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:29,803 INFO L225 Difference]: With dead ends: 7506 [2022-03-03 16:37:29,803 INFO L226 Difference]: Without dead ends: 7506 [2022-03-03 16:37:29,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:37:29,804 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1484 mSDsluCounter, 10165 mSDsCounter, 0 mSdLazyCounter, 3752 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 10739 SdHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:29,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 10739 Invalid, 3784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3752 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:37:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7506 states. [2022-03-03 16:37:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7506 to 5611. [2022-03-03 16:37:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5611 states, 5608 states have (on average 2.0493937232524964) internal successors, (11493), 5610 states have internal predecessors, (11493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5611 states to 5611 states and 11493 transitions. [2022-03-03 16:37:29,857 INFO L78 Accepts]: Start accepts. Automaton has 5611 states and 11493 transitions. Word has length 99 [2022-03-03 16:37:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:29,857 INFO L470 AbstractCegarLoop]: Abstraction has 5611 states and 11493 transitions. [2022-03-03 16:37:29,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5611 states and 11493 transitions. [2022-03-03 16:37:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:29,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:29,861 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] [2022-03-03 16:37:29,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-03-03 16:37:29,861 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash -86186341, now seen corresponding path program 61 times [2022-03-03 16:37:29,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:29,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153789758] [2022-03-03 16:37:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:30,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-03-03 16:37:30,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:30,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153789758] [2022-03-03 16:37:30,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153789758] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:30,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:30,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:37:30,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844665119] [2022-03-03 16:37:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:30,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:37:30,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:30,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:37:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:37:30,635 INFO L87 Difference]: Start difference. First operand 5611 states and 11493 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:35,204 INFO L93 Difference]: Finished difference Result 7288 states and 14960 transitions. [2022-03-03 16:37:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:37:35,204 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:35,212 INFO L225 Difference]: With dead ends: 7288 [2022-03-03 16:37:35,213 INFO L226 Difference]: Without dead ends: 7288 [2022-03-03 16:37:35,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:37:35,213 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1494 mSDsluCounter, 9462 mSDsCounter, 0 mSdLazyCounter, 3587 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 10014 SdHoareTripleChecker+Invalid, 3618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:35,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 10014 Invalid, 3618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3587 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:37:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7288 states. [2022-03-03 16:37:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7288 to 5635. [2022-03-03 16:37:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5635 states, 5632 states have (on average 2.049715909090909) internal successors, (11544), 5634 states have internal predecessors, (11544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 11544 transitions. [2022-03-03 16:37:35,285 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 11544 transitions. Word has length 99 [2022-03-03 16:37:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:35,285 INFO L470 AbstractCegarLoop]: Abstraction has 5635 states and 11544 transitions. [2022-03-03 16:37:35,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 11544 transitions. [2022-03-03 16:37:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:35,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:35,290 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] [2022-03-03 16:37:35,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-03-03 16:37:35,290 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash -178829853, now seen corresponding path program 62 times [2022-03-03 16:37:35,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:35,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001708745] [2022-03-03 16:37:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:36,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:36,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001708745] [2022-03-03 16:37:36,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001708745] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:36,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:36,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:37:36,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902108068] [2022-03-03 16:37:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:36,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:37:36,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:37:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:37:36,052 INFO L87 Difference]: Start difference. First operand 5635 states and 11544 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:41,315 INFO L93 Difference]: Finished difference Result 9328 states and 19168 transitions. [2022-03-03 16:37:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:37:41,315 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:41,324 INFO L225 Difference]: With dead ends: 9328 [2022-03-03 16:37:41,324 INFO L226 Difference]: Without dead ends: 9328 [2022-03-03 16:37:41,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:37:41,325 INFO L933 BasicCegarLoop]: 598 mSDtfsCounter, 1589 mSDsluCounter, 11272 mSDsCounter, 0 mSdLazyCounter, 4171 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 11870 SdHoareTripleChecker+Invalid, 4211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:41,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 11870 Invalid, 4211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4171 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:37:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9328 states. [2022-03-03 16:37:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9328 to 5637. [2022-03-03 16:37:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5634 states have (on average 2.0496982605608802) internal successors, (11548), 5636 states have internal predecessors, (11548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 11548 transitions. [2022-03-03 16:37:41,391 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 11548 transitions. Word has length 99 [2022-03-03 16:37:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:41,391 INFO L470 AbstractCegarLoop]: Abstraction has 5637 states and 11548 transitions. [2022-03-03 16:37:41,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 11548 transitions. [2022-03-03 16:37:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:41,395 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:41,395 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] [2022-03-03 16:37:41,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-03-03 16:37:41,395 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1028339571, now seen corresponding path program 63 times [2022-03-03 16:37:41,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:41,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362545030] [2022-03-03 16:37:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:42,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:42,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362545030] [2022-03-03 16:37:42,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362545030] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:42,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:42,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:37:42,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423896283] [2022-03-03 16:37:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:42,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:37:42,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:42,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:37:42,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:37:42,136 INFO L87 Difference]: Start difference. First operand 5637 states and 11548 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:46,578 INFO L93 Difference]: Finished difference Result 7370 states and 15126 transitions. [2022-03-03 16:37:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:37:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:46,586 INFO L225 Difference]: With dead ends: 7370 [2022-03-03 16:37:46,586 INFO L226 Difference]: Without dead ends: 7370 [2022-03-03 16:37:46,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=939, Invalid=4611, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:37:46,587 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1738 mSDsluCounter, 8881 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 9447 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:46,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1738 Valid, 9447 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3356 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:37:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2022-03-03 16:37:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 5619. [2022-03-03 16:37:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5619 states, 5616 states have (on average 2.0495014245014245) internal successors, (11510), 5618 states have internal predecessors, (11510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 11510 transitions. [2022-03-03 16:37:46,646 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 11510 transitions. Word has length 99 [2022-03-03 16:37:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:46,646 INFO L470 AbstractCegarLoop]: Abstraction has 5619 states and 11510 transitions. [2022-03-03 16:37:46,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 11510 transitions. [2022-03-03 16:37:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:46,651 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:46,651 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] [2022-03-03 16:37:46,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-03-03 16:37:46,651 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash -966883357, now seen corresponding path program 64 times [2022-03-03 16:37:46,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:46,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570895746] [2022-03-03 16:37:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:46,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:47,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:47,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570895746] [2022-03-03 16:37:47,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570895746] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:47,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:47,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:37:47,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921236186] [2022-03-03 16:37:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:47,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:37:47,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:37:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:37:47,407 INFO L87 Difference]: Start difference. First operand 5619 states and 11510 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:52,725 INFO L93 Difference]: Finished difference Result 9503 states and 19526 transitions. [2022-03-03 16:37:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:37:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:52,736 INFO L225 Difference]: With dead ends: 9503 [2022-03-03 16:37:52,736 INFO L226 Difference]: Without dead ends: 9503 [2022-03-03 16:37:52,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1180, Invalid=5462, Unknown=0, NotChecked=0, Total=6642 [2022-03-03 16:37:52,736 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 1799 mSDsluCounter, 10687 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 11309 SdHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:52,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1799 Valid, 11309 Invalid, 3784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:37:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9503 states. [2022-03-03 16:37:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9503 to 5620. [2022-03-03 16:37:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 5617 states have (on average 2.0494926117144385) internal successors, (11512), 5619 states have internal predecessors, (11512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 11512 transitions. [2022-03-03 16:37:52,807 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 11512 transitions. Word has length 99 [2022-03-03 16:37:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:52,807 INFO L470 AbstractCegarLoop]: Abstraction has 5620 states and 11512 transitions. [2022-03-03 16:37:52,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 11512 transitions. [2022-03-03 16:37:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:52,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:52,811 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] [2022-03-03 16:37:52,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-03-03 16:37:52,811 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash -988076429, now seen corresponding path program 65 times [2022-03-03 16:37:52,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:52,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527876056] [2022-03-03 16:37:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:53,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:53,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527876056] [2022-03-03 16:37:53,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527876056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:53,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:53,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:37:53,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663488594] [2022-03-03 16:37:53,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:53,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:37:53,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:53,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:37:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:37:53,482 INFO L87 Difference]: Start difference. First operand 5620 states and 11512 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:37:58,516 INFO L93 Difference]: Finished difference Result 8488 states and 17429 transitions. [2022-03-03 16:37:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:37:58,516 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:37:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:37:58,526 INFO L225 Difference]: With dead ends: 8488 [2022-03-03 16:37:58,526 INFO L226 Difference]: Without dead ends: 8488 [2022-03-03 16:37:58,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1044, Invalid=4962, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:37:58,527 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1646 mSDsluCounter, 10202 mSDsCounter, 0 mSdLazyCounter, 3833 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 10792 SdHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:37:58,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1646 Valid, 10792 Invalid, 3866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3833 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:37:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8488 states. [2022-03-03 16:37:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8488 to 5622. [2022-03-03 16:37:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5622 states, 5619 states have (on average 2.04947499555081) internal successors, (11516), 5621 states have internal predecessors, (11516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5622 states to 5622 states and 11516 transitions. [2022-03-03 16:37:58,613 INFO L78 Accepts]: Start accepts. Automaton has 5622 states and 11516 transitions. Word has length 99 [2022-03-03 16:37:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:37:58,613 INFO L470 AbstractCegarLoop]: Abstraction has 5622 states and 11516 transitions. [2022-03-03 16:37:58,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:37:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5622 states and 11516 transitions. [2022-03-03 16:37:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:37:58,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:37:58,617 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] [2022-03-03 16:37:58,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-03-03 16:37:58,617 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:37:58,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:37:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1472913395, now seen corresponding path program 66 times [2022-03-03 16:37:58,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:37:58,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460539572] [2022-03-03 16:37:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:37:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:37:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:37:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:37:59,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:37:59,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460539572] [2022-03-03 16:37:59,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460539572] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:37:59,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:37:59,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:37:59,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231545853] [2022-03-03 16:37:59,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:37:59,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:37:59,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:37:59,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:37:59,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:37:59,333 INFO L87 Difference]: Start difference. First operand 5622 states and 11516 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:03,913 INFO L93 Difference]: Finished difference Result 7443 states and 15275 transitions. [2022-03-03 16:38:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:38:03,913 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:03,921 INFO L225 Difference]: With dead ends: 7443 [2022-03-03 16:38:03,921 INFO L226 Difference]: Without dead ends: 7443 [2022-03-03 16:38:03,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=935, Invalid=4615, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:38:03,922 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1652 mSDsluCounter, 9549 mSDsCounter, 0 mSdLazyCounter, 3468 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 10115 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:03,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1652 Valid, 10115 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3468 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:38:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7443 states. [2022-03-03 16:38:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7443 to 5611. [2022-03-03 16:38:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5611 states, 5608 states have (on average 2.0493937232524964) internal successors, (11493), 5610 states have internal predecessors, (11493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5611 states to 5611 states and 11493 transitions. [2022-03-03 16:38:03,975 INFO L78 Accepts]: Start accepts. Automaton has 5611 states and 11493 transitions. Word has length 99 [2022-03-03 16:38:03,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:03,975 INFO L470 AbstractCegarLoop]: Abstraction has 5611 states and 11493 transitions. [2022-03-03 16:38:03,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5611 states and 11493 transitions. [2022-03-03 16:38:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:03,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:03,979 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] [2022-03-03 16:38:03,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-03-03 16:38:03,979 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1628672577, now seen corresponding path program 67 times [2022-03-03 16:38:03,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:03,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509765222] [2022-03-03 16:38:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:04,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:04,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509765222] [2022-03-03 16:38:04,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509765222] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:04,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:04,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:38:04,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325330321] [2022-03-03 16:38:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:04,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:38:04,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:38:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:38:04,701 INFO L87 Difference]: Start difference. First operand 5611 states and 11493 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:10,319 INFO L93 Difference]: Finished difference Result 7766 states and 15897 transitions. [2022-03-03 16:38:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-03 16:38:10,319 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:10,343 INFO L225 Difference]: With dead ends: 7766 [2022-03-03 16:38:10,343 INFO L226 Difference]: Without dead ends: 7766 [2022-03-03 16:38:10,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1251, Invalid=5721, Unknown=0, NotChecked=0, Total=6972 [2022-03-03 16:38:10,344 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1901 mSDsluCounter, 10191 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 10781 SdHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:10,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1901 Valid, 10781 Invalid, 3570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3524 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:38:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2022-03-03 16:38:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 5626. [2022-03-03 16:38:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5626 states, 5623 states have (on average 2.049261959807932) internal successors, (11523), 5625 states have internal predecessors, (11523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5626 states to 5626 states and 11523 transitions. [2022-03-03 16:38:10,394 INFO L78 Accepts]: Start accepts. Automaton has 5626 states and 11523 transitions. Word has length 99 [2022-03-03 16:38:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:10,394 INFO L470 AbstractCegarLoop]: Abstraction has 5626 states and 11523 transitions. [2022-03-03 16:38:10,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5626 states and 11523 transitions. [2022-03-03 16:38:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:10,398 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:10,398 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] [2022-03-03 16:38:10,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-03-03 16:38:10,398 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1781291341, now seen corresponding path program 68 times [2022-03-03 16:38:10,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:10,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461031496] [2022-03-03 16:38:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:10,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:11,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:11,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461031496] [2022-03-03 16:38:11,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461031496] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:11,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:11,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:38:11,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313210189] [2022-03-03 16:38:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:11,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:38:11,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:38:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:38:11,115 INFO L87 Difference]: Start difference. First operand 5626 states and 11523 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:16,453 INFO L93 Difference]: Finished difference Result 8214 states and 16844 transitions. [2022-03-03 16:38:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:38:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:16,462 INFO L225 Difference]: With dead ends: 8214 [2022-03-03 16:38:16,462 INFO L226 Difference]: Without dead ends: 8214 [2022-03-03 16:38:16,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1157, Invalid=5323, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 16:38:16,462 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1853 mSDsluCounter, 10825 mSDsCounter, 0 mSdLazyCounter, 3906 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 11415 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:16,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1853 Valid, 11415 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3906 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:38:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2022-03-03 16:38:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 5627. [2022-03-03 16:38:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5627 states, 5624 states have (on average 2.04925320056899) internal successors, (11525), 5626 states have internal predecessors, (11525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 11525 transitions. [2022-03-03 16:38:16,519 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 11525 transitions. Word has length 99 [2022-03-03 16:38:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:16,519 INFO L470 AbstractCegarLoop]: Abstraction has 5627 states and 11525 transitions. [2022-03-03 16:38:16,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 11525 transitions. [2022-03-03 16:38:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:16,523 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:16,523 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] [2022-03-03 16:38:16,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-03-03 16:38:16,523 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1760098269, now seen corresponding path program 69 times [2022-03-03 16:38:16,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:16,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005693909] [2022-03-03 16:38:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:17,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:17,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005693909] [2022-03-03 16:38:17,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005693909] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:17,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:17,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:38:17,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939548430] [2022-03-03 16:38:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:17,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:38:17,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:38:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:38:17,215 INFO L87 Difference]: Start difference. First operand 5627 states and 11525 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:21,915 INFO L93 Difference]: Finished difference Result 8127 states and 16667 transitions. [2022-03-03 16:38:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:38:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:21,925 INFO L225 Difference]: With dead ends: 8127 [2022-03-03 16:38:21,926 INFO L226 Difference]: Without dead ends: 8127 [2022-03-03 16:38:21,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1038, Invalid=4968, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:38:21,926 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1849 mSDsluCounter, 9219 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 9786 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:21,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1849 Valid, 9786 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:38:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8127 states. [2022-03-03 16:38:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8127 to 5629. [2022-03-03 16:38:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5629 states, 5626 states have (on average 2.049235691432634) internal successors, (11529), 5628 states have internal predecessors, (11529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5629 states to 5629 states and 11529 transitions. [2022-03-03 16:38:22,001 INFO L78 Accepts]: Start accepts. Automaton has 5629 states and 11529 transitions. Word has length 99 [2022-03-03 16:38:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:22,002 INFO L470 AbstractCegarLoop]: Abstraction has 5629 states and 11529 transitions. [2022-03-03 16:38:22,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5629 states and 11529 transitions. [2022-03-03 16:38:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:22,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:22,006 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] [2022-03-03 16:38:22,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-03-03 16:38:22,006 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash -73879203, now seen corresponding path program 70 times [2022-03-03 16:38:22,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:22,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847176090] [2022-03-03 16:38:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:22,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-03-03 16:38:22,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:22,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847176090] [2022-03-03 16:38:22,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847176090] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:22,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:22,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:38:22,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818926092] [2022-03-03 16:38:22,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:22,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:38:22,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:22,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:38:22,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:38:22,724 INFO L87 Difference]: Start difference. First operand 5629 states and 11529 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:27,060 INFO L93 Difference]: Finished difference Result 7082 states and 14513 transitions. [2022-03-03 16:38:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:38:27,060 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:27,068 INFO L225 Difference]: With dead ends: 7082 [2022-03-03 16:38:27,068 INFO L226 Difference]: Without dead ends: 7082 [2022-03-03 16:38:27,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=931, Invalid=4619, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:38:27,069 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 1481 mSDsluCounter, 8702 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 9245 SdHoareTripleChecker+Invalid, 3170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:27,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1481 Valid, 9245 Invalid, 3170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 16:38:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7082 states. [2022-03-03 16:38:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7082 to 5626. [2022-03-03 16:38:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5626 states, 5623 states have (on average 2.049261959807932) internal successors, (11523), 5625 states have internal predecessors, (11523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5626 states to 5626 states and 11523 transitions. [2022-03-03 16:38:27,127 INFO L78 Accepts]: Start accepts. Automaton has 5626 states and 11523 transitions. Word has length 99 [2022-03-03 16:38:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:27,127 INFO L470 AbstractCegarLoop]: Abstraction has 5626 states and 11523 transitions. [2022-03-03 16:38:27,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5626 states and 11523 transitions. [2022-03-03 16:38:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:27,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:27,131 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] [2022-03-03 16:38:27,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-03-03 16:38:27,131 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1594576337, now seen corresponding path program 71 times [2022-03-03 16:38:27,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:27,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112209877] [2022-03-03 16:38:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:28,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:28,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112209877] [2022-03-03 16:38:28,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112209877] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:28,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:28,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-03-03 16:38:28,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369003928] [2022-03-03 16:38:28,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:28,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-03 16:38:28,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:28,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-03 16:38:28,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 16:38:28,079 INFO L87 Difference]: Start difference. First operand 5626 states and 11523 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:33,575 INFO L93 Difference]: Finished difference Result 8150 states and 16747 transitions. [2022-03-03 16:38:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-03 16:38:33,575 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:33,599 INFO L225 Difference]: With dead ends: 8150 [2022-03-03 16:38:33,599 INFO L226 Difference]: Without dead ends: 8150 [2022-03-03 16:38:33,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1133, Invalid=5673, Unknown=0, NotChecked=0, Total=6806 [2022-03-03 16:38:33,600 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 1863 mSDsluCounter, 9742 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1863 SdHoareTripleChecker+Valid, 10303 SdHoareTripleChecker+Invalid, 3891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:33,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1863 Valid, 10303 Invalid, 3891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:38:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8150 states. [2022-03-03 16:38:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8150 to 5935. [2022-03-03 16:38:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5935 states, 5932 states have (on average 2.0559676331759946) internal successors, (12196), 5934 states have internal predecessors, (12196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 12196 transitions. [2022-03-03 16:38:33,656 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 12196 transitions. Word has length 99 [2022-03-03 16:38:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:33,656 INFO L470 AbstractCegarLoop]: Abstraction has 5935 states and 12196 transitions. [2022-03-03 16:38:33,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 12196 transitions. [2022-03-03 16:38:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:33,660 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:33,660 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] [2022-03-03 16:38:33,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-03-03 16:38:33,660 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash -492510357, now seen corresponding path program 72 times [2022-03-03 16:38:33,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:33,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112587369] [2022-03-03 16:38:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:34,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:34,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112587369] [2022-03-03 16:38:34,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112587369] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:34,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:34,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:38:34,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822838316] [2022-03-03 16:38:34,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:34,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:38:34,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:34,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:38:34,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:38:34,455 INFO L87 Difference]: Start difference. First operand 5935 states and 12196 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:38,920 INFO L93 Difference]: Finished difference Result 8946 states and 18387 transitions. [2022-03-03 16:38:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:38:38,920 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:38,930 INFO L225 Difference]: With dead ends: 8946 [2022-03-03 16:38:38,930 INFO L226 Difference]: Without dead ends: 8946 [2022-03-03 16:38:38,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:38:38,931 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1491 mSDsluCounter, 9480 mSDsCounter, 0 mSdLazyCounter, 3584 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 10037 SdHoareTripleChecker+Invalid, 3617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:38,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1491 Valid, 10037 Invalid, 3617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3584 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:38:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8946 states. [2022-03-03 16:38:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8946 to 5642. [2022-03-03 16:38:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5642 states, 5639 states have (on average 2.049476857598865) internal successors, (11557), 5641 states have internal predecessors, (11557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 11557 transitions. [2022-03-03 16:38:39,008 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 11557 transitions. Word has length 99 [2022-03-03 16:38:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:39,008 INFO L470 AbstractCegarLoop]: Abstraction has 5642 states and 11557 transitions. [2022-03-03 16:38:39,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 11557 transitions. [2022-03-03 16:38:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:39,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:39,012 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] [2022-03-03 16:38:39,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-03-03 16:38:39,012 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1687219849, now seen corresponding path program 73 times [2022-03-03 16:38:39,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:39,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722901670] [2022-03-03 16:38:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:39,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:39,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722901670] [2022-03-03 16:38:39,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722901670] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:39,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:39,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:38:39,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133748272] [2022-03-03 16:38:39,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:39,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:38:39,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:38:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:38:39,745 INFO L87 Difference]: Start difference. First operand 5642 states and 11557 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:44,732 INFO L93 Difference]: Finished difference Result 9534 states and 19599 transitions. [2022-03-03 16:38:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:38:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:44,743 INFO L225 Difference]: With dead ends: 9534 [2022-03-03 16:38:44,743 INFO L226 Difference]: Without dead ends: 9534 [2022-03-03 16:38:44,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:38:44,744 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 1912 mSDsluCounter, 10513 mSDsCounter, 0 mSdLazyCounter, 3899 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 11116 SdHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:44,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1912 Valid, 11116 Invalid, 3944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3899 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:38:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9534 states. [2022-03-03 16:38:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9534 to 5644. [2022-03-03 16:38:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5644 states, 5641 states have (on average 2.0494593157241625) internal successors, (11561), 5643 states have internal predecessors, (11561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5644 states to 5644 states and 11561 transitions. [2022-03-03 16:38:44,817 INFO L78 Accepts]: Start accepts. Automaton has 5644 states and 11561 transitions. Word has length 99 [2022-03-03 16:38:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:44,818 INFO L470 AbstractCegarLoop]: Abstraction has 5644 states and 11561 transitions. [2022-03-03 16:38:44,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5644 states and 11561 transitions. [2022-03-03 16:38:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:44,822 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:44,822 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] [2022-03-03 16:38:44,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-03-03 16:38:44,822 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash -480050425, now seen corresponding path program 74 times [2022-03-03 16:38:44,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:44,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448768330] [2022-03-03 16:38:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:45,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:45,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448768330] [2022-03-03 16:38:45,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448768330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:45,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:45,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:38:45,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536139138] [2022-03-03 16:38:45,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:45,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:38:45,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:38:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:38:45,516 INFO L87 Difference]: Start difference. First operand 5644 states and 11561 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:50,341 INFO L93 Difference]: Finished difference Result 7576 states and 15557 transitions. [2022-03-03 16:38:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:38:50,342 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:50,350 INFO L225 Difference]: With dead ends: 7576 [2022-03-03 16:38:50,350 INFO L226 Difference]: Without dead ends: 7576 [2022-03-03 16:38:50,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=939, Invalid=4611, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:38:50,351 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1467 mSDsluCounter, 10757 mSDsCounter, 0 mSdLazyCounter, 4243 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 11328 SdHoareTripleChecker+Invalid, 4275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:50,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1467 Valid, 11328 Invalid, 4275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4243 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:38:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7576 states. [2022-03-03 16:38:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7576 to 5626. [2022-03-03 16:38:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5626 states, 5623 states have (on average 2.049261959807932) internal successors, (11523), 5625 states have internal predecessors, (11523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5626 states to 5626 states and 11523 transitions. [2022-03-03 16:38:50,424 INFO L78 Accepts]: Start accepts. Automaton has 5626 states and 11523 transitions. Word has length 99 [2022-03-03 16:38:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:50,425 INFO L470 AbstractCegarLoop]: Abstraction has 5626 states and 11523 transitions. [2022-03-03 16:38:50,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5626 states and 11523 transitions. [2022-03-03 16:38:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:50,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:50,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:38:50,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-03-03 16:38:50,429 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1819693943, now seen corresponding path program 75 times [2022-03-03 16:38:50,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:50,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555953536] [2022-03-03 16:38:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:38:51,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:51,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555953536] [2022-03-03 16:38:51,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555953536] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:51,092 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:51,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:38:51,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074171809] [2022-03-03 16:38:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:51,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:38:51,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:38:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:38:51,093 INFO L87 Difference]: Start difference. First operand 5626 states and 11523 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:38:56,589 INFO L93 Difference]: Finished difference Result 9609 states and 19737 transitions. [2022-03-03 16:38:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:38:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:38:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:38:56,598 INFO L225 Difference]: With dead ends: 9609 [2022-03-03 16:38:56,598 INFO L226 Difference]: Without dead ends: 9609 [2022-03-03 16:38:56,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1165, Invalid=5315, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 16:38:56,599 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 1748 mSDsluCounter, 11005 mSDsCounter, 0 mSdLazyCounter, 4042 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 11632 SdHoareTripleChecker+Invalid, 4076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:38:56,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1748 Valid, 11632 Invalid, 4076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4042 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:38:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9609 states. [2022-03-03 16:38:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9609 to 5627. [2022-03-03 16:38:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5627 states, 5624 states have (on average 2.04925320056899) internal successors, (11525), 5626 states have internal predecessors, (11525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 11525 transitions. [2022-03-03 16:38:56,653 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 11525 transitions. Word has length 99 [2022-03-03 16:38:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:38:56,653 INFO L470 AbstractCegarLoop]: Abstraction has 5627 states and 11525 transitions. [2022-03-03 16:38:56,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:38:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 11525 transitions. [2022-03-03 16:38:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:38:56,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:38:56,657 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] [2022-03-03 16:38:56,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-03-03 16:38:56,657 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:38:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:38:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1798500871, now seen corresponding path program 76 times [2022-03-03 16:38:56,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:38:56,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687018182] [2022-03-03 16:38:56,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:38:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:38:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:38:57,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-03-03 16:38:57,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:38:57,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687018182] [2022-03-03 16:38:57,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687018182] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:38:57,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:38:57,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:38:57,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781275543] [2022-03-03 16:38:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:38:57,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:38:57,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:38:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:38:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:38:57,409 INFO L87 Difference]: Start difference. First operand 5627 states and 11525 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:02,172 INFO L93 Difference]: Finished difference Result 8594 states and 17640 transitions. [2022-03-03 16:39:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:39:02,172 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:02,181 INFO L225 Difference]: With dead ends: 8594 [2022-03-03 16:39:02,181 INFO L226 Difference]: Without dead ends: 8594 [2022-03-03 16:39:02,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1059, Invalid=5103, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:39:02,182 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 2011 mSDsluCounter, 9559 mSDsCounter, 0 mSdLazyCounter, 3488 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 10154 SdHoareTripleChecker+Invalid, 3532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:02,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2011 Valid, 10154 Invalid, 3532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3488 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:39:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2022-03-03 16:39:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 5629. [2022-03-03 16:39:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5629 states, 5626 states have (on average 2.049235691432634) internal successors, (11529), 5628 states have internal predecessors, (11529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5629 states to 5629 states and 11529 transitions. [2022-03-03 16:39:02,247 INFO L78 Accepts]: Start accepts. Automaton has 5629 states and 11529 transitions. Word has length 99 [2022-03-03 16:39:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:02,247 INFO L470 AbstractCegarLoop]: Abstraction has 5629 states and 11529 transitions. [2022-03-03 16:39:02,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5629 states and 11529 transitions. [2022-03-03 16:39:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:02,252 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:02,252 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] [2022-03-03 16:39:02,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-03-03 16:39:02,252 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash -35476601, now seen corresponding path program 77 times [2022-03-03 16:39:02,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:02,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524482926] [2022-03-03 16:39:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:02,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:02,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524482926] [2022-03-03 16:39:02,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524482926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:02,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:02,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:39:02,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51503361] [2022-03-03 16:39:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:02,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:39:02,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:39:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:39:02,956 INFO L87 Difference]: Start difference. First operand 5629 states and 11529 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:07,608 INFO L93 Difference]: Finished difference Result 7549 states and 15486 transitions. [2022-03-03 16:39:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:39:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:07,616 INFO L225 Difference]: With dead ends: 7549 [2022-03-03 16:39:07,617 INFO L226 Difference]: Without dead ends: 7549 [2022-03-03 16:39:07,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=935, Invalid=4615, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:39:07,617 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1600 mSDsluCounter, 9675 mSDsCounter, 0 mSdLazyCounter, 3672 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 10246 SdHoareTripleChecker+Invalid, 3708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:07,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1600 Valid, 10246 Invalid, 3708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3672 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:39:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2022-03-03 16:39:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 5618. [2022-03-03 16:39:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5618 states, 5615 states have (on average 2.049154051647373) internal successors, (11506), 5617 states have internal predecessors, (11506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5618 states to 5618 states and 11506 transitions. [2022-03-03 16:39:07,684 INFO L78 Accepts]: Start accepts. Automaton has 5618 states and 11506 transitions. Word has length 99 [2022-03-03 16:39:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:07,684 INFO L470 AbstractCegarLoop]: Abstraction has 5618 states and 11506 transitions. [2022-03-03 16:39:07,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5618 states and 11506 transitions. [2022-03-03 16:39:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:07,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:07,688 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] [2022-03-03 16:39:07,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-03-03 16:39:07,688 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash -67592007, now seen corresponding path program 78 times [2022-03-03 16:39:07,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:07,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780084888] [2022-03-03 16:39:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:08,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:08,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780084888] [2022-03-03 16:39:08,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780084888] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:08,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:08,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:39:08,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983960902] [2022-03-03 16:39:08,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:08,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:39:08,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:08,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:39:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:39:08,489 INFO L87 Difference]: Start difference. First operand 5618 states and 11506 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:13,218 INFO L93 Difference]: Finished difference Result 7448 states and 15296 transitions. [2022-03-03 16:39:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:39:13,218 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:13,227 INFO L225 Difference]: With dead ends: 7448 [2022-03-03 16:39:13,227 INFO L226 Difference]: Without dead ends: 7448 [2022-03-03 16:39:13,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:39:13,228 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1613 mSDsluCounter, 10530 mSDsCounter, 0 mSdLazyCounter, 4088 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 11086 SdHoareTripleChecker+Invalid, 4127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:13,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 11086 Invalid, 4127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4088 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:39:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2022-03-03 16:39:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5618. [2022-03-03 16:39:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5618 states, 5615 states have (on average 2.049154051647373) internal successors, (11506), 5617 states have internal predecessors, (11506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5618 states to 5618 states and 11506 transitions. [2022-03-03 16:39:13,302 INFO L78 Accepts]: Start accepts. Automaton has 5618 states and 11506 transitions. Word has length 99 [2022-03-03 16:39:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:13,302 INFO L470 AbstractCegarLoop]: Abstraction has 5618 states and 11506 transitions. [2022-03-03 16:39:13,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5618 states and 11506 transitions. [2022-03-03 16:39:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:13,305 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:13,305 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] [2022-03-03 16:39:13,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-03-03 16:39:13,306 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash -160235519, now seen corresponding path program 79 times [2022-03-03 16:39:13,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:13,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622409785] [2022-03-03 16:39:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:14,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:14,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622409785] [2022-03-03 16:39:14,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622409785] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:14,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:14,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:39:14,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895261158] [2022-03-03 16:39:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:14,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:39:14,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:39:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:39:14,048 INFO L87 Difference]: Start difference. First operand 5618 states and 11506 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:19,169 INFO L93 Difference]: Finished difference Result 9338 states and 19185 transitions. [2022-03-03 16:39:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:39:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:19,180 INFO L225 Difference]: With dead ends: 9338 [2022-03-03 16:39:19,181 INFO L226 Difference]: Without dead ends: 9338 [2022-03-03 16:39:19,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:39:19,181 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 1885 mSDsluCounter, 10428 mSDsCounter, 0 mSdLazyCounter, 3975 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 11030 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:19,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1885 Valid, 11030 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3975 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:39:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9338 states. [2022-03-03 16:39:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9338 to 5612. [2022-03-03 16:39:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5612 states, 5609 states have (on average 2.0492066321982527) internal successors, (11494), 5611 states have internal predecessors, (11494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 11494 transitions. [2022-03-03 16:39:19,251 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 11494 transitions. Word has length 99 [2022-03-03 16:39:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:19,251 INFO L470 AbstractCegarLoop]: Abstraction has 5612 states and 11494 transitions. [2022-03-03 16:39:19,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 11494 transitions. [2022-03-03 16:39:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:19,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:19,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:39:19,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-03-03 16:39:19,255 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1046933905, now seen corresponding path program 80 times [2022-03-03 16:39:19,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:19,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216400225] [2022-03-03 16:39:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:19,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:19,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:19,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216400225] [2022-03-03 16:39:19,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216400225] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:19,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:19,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:39:19,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259252600] [2022-03-03 16:39:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:19,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:39:19,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:19,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:39:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:39:19,990 INFO L87 Difference]: Start difference. First operand 5612 states and 11494 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:24,838 INFO L93 Difference]: Finished difference Result 7448 states and 15279 transitions. [2022-03-03 16:39:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:39:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:24,846 INFO L225 Difference]: With dead ends: 7448 [2022-03-03 16:39:24,846 INFO L226 Difference]: Without dead ends: 7448 [2022-03-03 16:39:24,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:39:24,847 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1554 mSDsluCounter, 11077 mSDsCounter, 0 mSdLazyCounter, 4372 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 11647 SdHoareTripleChecker+Invalid, 4410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:24,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1554 Valid, 11647 Invalid, 4410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4372 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 16:39:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2022-03-03 16:39:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5594. [2022-03-03 16:39:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5594 states, 5591 states have (on average 2.049007333214094) internal successors, (11456), 5593 states have internal predecessors, (11456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5594 states to 5594 states and 11456 transitions. [2022-03-03 16:39:24,910 INFO L78 Accepts]: Start accepts. Automaton has 5594 states and 11456 transitions. Word has length 99 [2022-03-03 16:39:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:24,910 INFO L470 AbstractCegarLoop]: Abstraction has 5594 states and 11456 transitions. [2022-03-03 16:39:24,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 5594 states and 11456 transitions. [2022-03-03 16:39:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:24,913 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:24,914 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] [2022-03-03 16:39:24,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-03-03 16:39:24,914 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1638182441, now seen corresponding path program 81 times [2022-03-03 16:39:24,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:24,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508920359] [2022-03-03 16:39:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:24,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:25,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:25,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508920359] [2022-03-03 16:39:25,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508920359] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:25,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:25,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:39:25,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904540981] [2022-03-03 16:39:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:25,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:39:25,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:39:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:39:25,714 INFO L87 Difference]: Start difference. First operand 5594 states and 11456 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:30,274 INFO L93 Difference]: Finished difference Result 7135 states and 14634 transitions. [2022-03-03 16:39:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:39:30,274 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:30,283 INFO L225 Difference]: With dead ends: 7135 [2022-03-03 16:39:30,283 INFO L226 Difference]: Without dead ends: 7135 [2022-03-03 16:39:30,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:39:30,284 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 1489 mSDsluCounter, 9729 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 10283 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:30,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 10283 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:39:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7135 states. [2022-03-03 16:39:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7135 to 5370. [2022-03-03 16:39:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5370 states, 5367 states have (on average 2.047885224520216) internal successors, (10991), 5369 states have internal predecessors, (10991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5370 states to 5370 states and 10991 transitions. [2022-03-03 16:39:30,343 INFO L78 Accepts]: Start accepts. Automaton has 5370 states and 10991 transitions. Word has length 99 [2022-03-03 16:39:30,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:30,344 INFO L470 AbstractCegarLoop]: Abstraction has 5370 states and 10991 transitions. [2022-03-03 16:39:30,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5370 states and 10991 transitions. [2022-03-03 16:39:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:30,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:30,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:39:30,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-03-03 16:39:30,360 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1568360313, now seen corresponding path program 82 times [2022-03-03 16:39:30,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:30,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925921728] [2022-03-03 16:39:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:31,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:31,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925921728] [2022-03-03 16:39:31,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925921728] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:31,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:31,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:39:31,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527136719] [2022-03-03 16:39:31,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:31,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:39:31,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:31,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:39:31,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:39:31,179 INFO L87 Difference]: Start difference. First operand 5370 states and 10991 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:35,836 INFO L93 Difference]: Finished difference Result 7501 states and 15407 transitions. [2022-03-03 16:39:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:39:35,836 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:35,845 INFO L225 Difference]: With dead ends: 7501 [2022-03-03 16:39:35,845 INFO L226 Difference]: Without dead ends: 7501 [2022-03-03 16:39:35,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:39:35,846 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1623 mSDsluCounter, 10115 mSDsCounter, 0 mSdLazyCounter, 4009 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 10672 SdHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 4009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:35,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1623 Valid, 10672 Invalid, 4044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 4009 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:39:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7501 states. [2022-03-03 16:39:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7501 to 5397. [2022-03-03 16:39:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5397 states, 5394 states have (on average 2.0482017055988133) internal successors, (11048), 5396 states have internal predecessors, (11048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 11048 transitions. [2022-03-03 16:39:35,905 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 11048 transitions. Word has length 99 [2022-03-03 16:39:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:35,905 INFO L470 AbstractCegarLoop]: Abstraction has 5397 states and 11048 transitions. [2022-03-03 16:39:35,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 11048 transitions. [2022-03-03 16:39:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:35,909 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:35,909 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] [2022-03-03 16:39:35,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-03-03 16:39:35,909 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1661003825, now seen corresponding path program 83 times [2022-03-03 16:39:35,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:35,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362094526] [2022-03-03 16:39:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:36,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:36,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362094526] [2022-03-03 16:39:36,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362094526] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:36,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:36,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:39:36,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727701725] [2022-03-03 16:39:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:36,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:39:36,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:39:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:39:36,587 INFO L87 Difference]: Start difference. First operand 5397 states and 11048 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:41,683 INFO L93 Difference]: Finished difference Result 9583 states and 19701 transitions. [2022-03-03 16:39:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:39:41,684 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:41,696 INFO L225 Difference]: With dead ends: 9583 [2022-03-03 16:39:41,696 INFO L226 Difference]: Without dead ends: 9583 [2022-03-03 16:39:41,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006 [2022-03-03 16:39:41,697 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 1618 mSDsluCounter, 10933 mSDsCounter, 0 mSdLazyCounter, 4122 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 11536 SdHoareTripleChecker+Invalid, 4154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:41,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1618 Valid, 11536 Invalid, 4154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4122 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:39:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9583 states. [2022-03-03 16:39:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9583 to 5399. [2022-03-03 16:39:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5399 states, 5396 states have (on average 2.0481838398813936) internal successors, (11052), 5398 states have internal predecessors, (11052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 11052 transitions. [2022-03-03 16:39:41,768 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 11052 transitions. Word has length 99 [2022-03-03 16:39:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:41,769 INFO L470 AbstractCegarLoop]: Abstraction has 5399 states and 11052 transitions. [2022-03-03 16:39:41,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 11052 transitions. [2022-03-03 16:39:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:41,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:41,773 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] [2022-03-03 16:39:41,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-03-03 16:39:41,773 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash -453834401, now seen corresponding path program 84 times [2022-03-03 16:39:41,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:41,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695962417] [2022-03-03 16:39:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:42,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:42,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695962417] [2022-03-03 16:39:42,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695962417] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:42,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:42,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:39:42,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255994708] [2022-03-03 16:39:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:42,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:39:42,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:39:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:39:42,564 INFO L87 Difference]: Start difference. First operand 5399 states and 11052 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:47,132 INFO L93 Difference]: Finished difference Result 7605 states and 15617 transitions. [2022-03-03 16:39:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:39:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:47,141 INFO L225 Difference]: With dead ends: 7605 [2022-03-03 16:39:47,141 INFO L226 Difference]: Without dead ends: 7605 [2022-03-03 16:39:47,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700 [2022-03-03 16:39:47,141 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1573 mSDsluCounter, 9073 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 9644 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:47,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1573 Valid, 9644 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 16:39:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2022-03-03 16:39:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 5381. [2022-03-03 16:39:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5381 states, 5378 states have (on average 2.047973224246932) internal successors, (11014), 5380 states have internal predecessors, (11014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5381 states to 5381 states and 11014 transitions. [2022-03-03 16:39:47,192 INFO L78 Accepts]: Start accepts. Automaton has 5381 states and 11014 transitions. Word has length 99 [2022-03-03 16:39:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:47,193 INFO L470 AbstractCegarLoop]: Abstraction has 5381 states and 11014 transitions. [2022-03-03 16:39:47,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states and 11014 transitions. [2022-03-03 16:39:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:47,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:47,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:39:47,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-03-03 16:39:47,197 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1845909967, now seen corresponding path program 85 times [2022-03-03 16:39:47,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:47,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758424289] [2022-03-03 16:39:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:47,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:47,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758424289] [2022-03-03 16:39:47,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758424289] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:47,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:47,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:39:47,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362496437] [2022-03-03 16:39:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:47,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:39:47,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:39:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:39:47,886 INFO L87 Difference]: Start difference. First operand 5381 states and 11014 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:53,273 INFO L93 Difference]: Finished difference Result 9616 states and 19753 transitions. [2022-03-03 16:39:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 16:39:53,273 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:53,285 INFO L225 Difference]: With dead ends: 9616 [2022-03-03 16:39:53,285 INFO L226 Difference]: Without dead ends: 9616 [2022-03-03 16:39:53,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1165, Invalid=5315, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 16:39:53,286 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 1704 mSDsluCounter, 11029 mSDsCounter, 0 mSdLazyCounter, 4080 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 11656 SdHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:53,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1704 Valid, 11656 Invalid, 4112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4080 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:39:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2022-03-03 16:39:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 5382. [2022-03-03 16:39:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5382 states, 5379 states have (on average 2.0479643056330175) internal successors, (11016), 5381 states have internal predecessors, (11016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 11016 transitions. [2022-03-03 16:39:53,357 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 11016 transitions. Word has length 99 [2022-03-03 16:39:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:53,358 INFO L470 AbstractCegarLoop]: Abstraction has 5382 states and 11016 transitions. [2022-03-03 16:39:53,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 11016 transitions. [2022-03-03 16:39:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:53,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:53,362 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] [2022-03-03 16:39:53,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-03-03 16:39:53,362 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1824716895, now seen corresponding path program 86 times [2022-03-03 16:39:53,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:53,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721320068] [2022-03-03 16:39:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:54,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:54,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721320068] [2022-03-03 16:39:54,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721320068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:54,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:54,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:39:54,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769677589] [2022-03-03 16:39:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:54,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:39:54,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:39:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:39:54,102 INFO L87 Difference]: Start difference. First operand 5382 states and 11016 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:39:59,025 INFO L93 Difference]: Finished difference Result 8622 states and 17696 transitions. [2022-03-03 16:39:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:39:59,026 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:39:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:39:59,036 INFO L225 Difference]: With dead ends: 8622 [2022-03-03 16:39:59,036 INFO L226 Difference]: Without dead ends: 8622 [2022-03-03 16:39:59,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1059, Invalid=5103, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:39:59,037 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 1919 mSDsluCounter, 10175 mSDsCounter, 0 mSdLazyCounter, 3771 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 10770 SdHoareTripleChecker+Invalid, 3813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:39:59,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1919 Valid, 10770 Invalid, 3813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3771 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:39:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8622 states. [2022-03-03 16:39:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8622 to 5384. [2022-03-03 16:39:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5384 states, 5381 states have (on average 2.047946478349749) internal successors, (11020), 5383 states have internal predecessors, (11020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 11020 transitions. [2022-03-03 16:39:59,103 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 11020 transitions. Word has length 99 [2022-03-03 16:39:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:39:59,103 INFO L470 AbstractCegarLoop]: Abstraction has 5384 states and 11020 transitions. [2022-03-03 16:39:59,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:39:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 11020 transitions. [2022-03-03 16:39:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:39:59,107 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:39:59,107 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] [2022-03-03 16:39:59,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-03-03 16:39:59,108 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:39:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:39:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash -9260577, now seen corresponding path program 87 times [2022-03-03 16:39:59,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:39:59,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084073545] [2022-03-03 16:39:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:39:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:39:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:39:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:39:59,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:39:59,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084073545] [2022-03-03 16:39:59,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084073545] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:39:59,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:39:59,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:39:59,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004243199] [2022-03-03 16:39:59,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:39:59,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:39:59,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:39:59,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:39:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:39:59,818 INFO L87 Difference]: Start difference. First operand 5384 states and 11020 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:40:04,427 INFO L93 Difference]: Finished difference Result 7577 states and 15542 transitions. [2022-03-03 16:40:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:40:04,427 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:40:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:40:04,437 INFO L225 Difference]: With dead ends: 7577 [2022-03-03 16:40:04,437 INFO L226 Difference]: Without dead ends: 7577 [2022-03-03 16:40:04,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=935, Invalid=4615, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:40:04,438 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1499 mSDsluCounter, 9394 mSDsCounter, 0 mSdLazyCounter, 3611 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 9965 SdHoareTripleChecker+Invalid, 3644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:04,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 9965 Invalid, 3644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3611 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:40:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-03-03 16:40:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5381. [2022-03-03 16:40:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5381 states, 5378 states have (on average 2.047973224246932) internal successors, (11014), 5380 states have internal predecessors, (11014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5381 states to 5381 states and 11014 transitions. [2022-03-03 16:40:04,506 INFO L78 Accepts]: Start accepts. Automaton has 5381 states and 11014 transitions. Word has length 99 [2022-03-03 16:40:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:40:04,507 INFO L470 AbstractCegarLoop]: Abstraction has 5381 states and 11014 transitions. [2022-03-03 16:40:04,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states and 11014 transitions. [2022-03-03 16:40:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:40:04,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:40:04,511 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] [2022-03-03 16:40:04,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-03-03 16:40:04,511 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:40:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:40:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash -41375983, now seen corresponding path program 88 times [2022-03-03 16:40:04,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:40:04,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528408046] [2022-03-03 16:40:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:40:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:40:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:40:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:40:05,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:40:05,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528408046] [2022-03-03 16:40:05,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528408046] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:40:05,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:40:05,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:40:05,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769691572] [2022-03-03 16:40:05,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:40:05,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:40:05,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:40:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:40:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:40:05,311 INFO L87 Difference]: Start difference. First operand 5381 states and 11014 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:40:10,010 INFO L93 Difference]: Finished difference Result 7844 states and 16129 transitions. [2022-03-03 16:40:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:40:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:40:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:40:10,024 INFO L225 Difference]: With dead ends: 7844 [2022-03-03 16:40:10,024 INFO L226 Difference]: Without dead ends: 7844 [2022-03-03 16:40:10,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:40:10,025 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1527 mSDsluCounter, 9953 mSDsCounter, 0 mSdLazyCounter, 3961 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 10515 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:10,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1527 Valid, 10515 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3961 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 16:40:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-03-03 16:40:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 5399. [2022-03-03 16:40:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5399 states, 5396 states have (on average 2.0481838398813936) internal successors, (11052), 5398 states have internal predecessors, (11052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 11052 transitions. [2022-03-03 16:40:10,098 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 11052 transitions. Word has length 99 [2022-03-03 16:40:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:40:10,098 INFO L470 AbstractCegarLoop]: Abstraction has 5399 states and 11052 transitions. [2022-03-03 16:40:10,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 11052 transitions. [2022-03-03 16:40:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:40:10,103 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:40:10,103 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] [2022-03-03 16:40:10,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-03-03 16:40:10,103 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:40:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:40:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -134019495, now seen corresponding path program 89 times [2022-03-03 16:40:10,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:40:10,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192896341] [2022-03-03 16:40:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:40:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:40:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:40:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:40:10,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:40:10,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192896341] [2022-03-03 16:40:10,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192896341] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:40:10,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:40:10,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:40:10,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068672626] [2022-03-03 16:40:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:40:10,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:40:10,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:40:10,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:40:10,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:40:10,816 INFO L87 Difference]: Start difference. First operand 5399 states and 11052 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:40:15,912 INFO L93 Difference]: Finished difference Result 9814 states and 20180 transitions. [2022-03-03 16:40:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:40:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:40:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:40:15,924 INFO L225 Difference]: With dead ends: 9814 [2022-03-03 16:40:15,924 INFO L226 Difference]: Without dead ends: 9814 [2022-03-03 16:40:15,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:40:15,924 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 1605 mSDsluCounter, 11034 mSDsCounter, 0 mSdLazyCounter, 4276 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 11642 SdHoareTripleChecker+Invalid, 4316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:15,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1605 Valid, 11642 Invalid, 4316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4276 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:40:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2022-03-03 16:40:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 5401. [2022-03-03 16:40:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5398 states have (on average 2.048165987402742) internal successors, (11056), 5400 states have internal predecessors, (11056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 11056 transitions. [2022-03-03 16:40:15,984 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 11056 transitions. Word has length 99 [2022-03-03 16:40:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:40:15,985 INFO L470 AbstractCegarLoop]: Abstraction has 5401 states and 11056 transitions. [2022-03-03 16:40:15,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 11056 transitions. [2022-03-03 16:40:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:40:15,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:40:15,988 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] [2022-03-03 16:40:15,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-03-03 16:40:15,989 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:40:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:40:15,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1073149929, now seen corresponding path program 90 times [2022-03-03 16:40:15,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:40:15,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227553076] [2022-03-03 16:40:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:40:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:40:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:40:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:40:16,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:40:16,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227553076] [2022-03-03 16:40:16,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227553076] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:40:16,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:40:16,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:40:16,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520626067] [2022-03-03 16:40:16,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:40:16,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:40:16,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:40:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:40:16,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:40:16,661 INFO L87 Difference]: Start difference. First operand 5401 states and 11056 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:40:21,441 INFO L93 Difference]: Finished difference Result 7907 states and 16238 transitions. [2022-03-03 16:40:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:40:21,442 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:40:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:40:21,450 INFO L225 Difference]: With dead ends: 7907 [2022-03-03 16:40:21,450 INFO L226 Difference]: Without dead ends: 7907 [2022-03-03 16:40:21,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=939, Invalid=4611, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:40:21,451 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1543 mSDsluCounter, 10098 mSDsCounter, 0 mSdLazyCounter, 4064 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 10674 SdHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:21,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1543 Valid, 10674 Invalid, 4098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4064 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:40:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7907 states. [2022-03-03 16:40:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7907 to 5383. [2022-03-03 16:40:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5383 states, 5380 states have (on average 2.0479553903345726) internal successors, (11018), 5382 states have internal predecessors, (11018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 11018 transitions. [2022-03-03 16:40:21,502 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 11018 transitions. Word has length 99 [2022-03-03 16:40:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:40:21,502 INFO L470 AbstractCegarLoop]: Abstraction has 5383 states and 11018 transitions. [2022-03-03 16:40:21,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 11018 transitions. [2022-03-03 16:40:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:40:21,506 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:40:21,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:40:21,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-03-03 16:40:21,506 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:40:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:40:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1611966417, now seen corresponding path program 91 times [2022-03-03 16:40:21,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:40:21,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270806803] [2022-03-03 16:40:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:40:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:40:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:40:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:40:22,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:40:22,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270806803] [2022-03-03 16:40:22,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270806803] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:40:22,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:40:22,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:40:22,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366629289] [2022-03-03 16:40:22,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:40:22,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:40:22,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:40:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:40:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:40:22,298 INFO L87 Difference]: Start difference. First operand 5383 states and 11018 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:40:26,752 INFO L93 Difference]: Finished difference Result 7588 states and 15581 transitions. [2022-03-03 16:40:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:40:26,779 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:40:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:40:26,789 INFO L225 Difference]: With dead ends: 7588 [2022-03-03 16:40:26,789 INFO L226 Difference]: Without dead ends: 7588 [2022-03-03 16:40:26,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:40:26,789 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1486 mSDsluCounter, 9509 mSDsCounter, 0 mSdLazyCounter, 3702 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 10069 SdHoareTripleChecker+Invalid, 3735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:26,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 10069 Invalid, 3735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:40:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2022-03-03 16:40:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 5381. [2022-03-03 16:40:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5381 states, 5378 states have (on average 2.047973224246932) internal successors, (11014), 5380 states have internal predecessors, (11014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5381 states to 5381 states and 11014 transitions. [2022-03-03 16:40:26,859 INFO L78 Accepts]: Start accepts. Automaton has 5381 states and 11014 transitions. Word has length 99 [2022-03-03 16:40:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:40:26,859 INFO L470 AbstractCegarLoop]: Abstraction has 5381 states and 11014 transitions. [2022-03-03 16:40:26,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states and 11014 transitions. [2022-03-03 16:40:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:40:26,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:40:26,863 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] [2022-03-03 16:40:26,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-03-03 16:40:26,863 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:40:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:40:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -795570981, now seen corresponding path program 92 times [2022-03-03 16:40:26,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:40:26,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548527926] [2022-03-03 16:40:26,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:40:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:40:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:40:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:40:27,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:40:27,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548527926] [2022-03-03 16:40:27,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548527926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:40:27,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:40:27,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:40:27,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400252375] [2022-03-03 16:40:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:40:27,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:40:27,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:40:27,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:40:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:40:27,605 INFO L87 Difference]: Start difference. First operand 5381 states and 11014 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:40:32,166 INFO L93 Difference]: Finished difference Result 7653 states and 15728 transitions. [2022-03-03 16:40:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-03 16:40:32,166 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:40:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:40:32,174 INFO L225 Difference]: With dead ends: 7653 [2022-03-03 16:40:32,174 INFO L226 Difference]: Without dead ends: 7653 [2022-03-03 16:40:32,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550 [2022-03-03 16:40:32,175 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1743 mSDsluCounter, 9383 mSDsCounter, 0 mSdLazyCounter, 3705 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 9939 SdHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:32,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1743 Valid, 9939 Invalid, 3743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3705 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 16:40:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7653 states. [2022-03-03 16:40:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7653 to 5403. [2022-03-03 16:40:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 5400 states have (on average 2.0481481481481483) internal successors, (11060), 5402 states have internal predecessors, (11060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 11060 transitions. [2022-03-03 16:40:32,225 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 11060 transitions. Word has length 99 [2022-03-03 16:40:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:40:32,225 INFO L470 AbstractCegarLoop]: Abstraction has 5403 states and 11060 transitions. [2022-03-03 16:40:32,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 11060 transitions. [2022-03-03 16:40:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:40:32,242 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:40:32,242 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] [2022-03-03 16:40:32,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-03-03 16:40:32,243 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:40:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:40:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash -888214493, now seen corresponding path program 93 times [2022-03-03 16:40:32,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:40:32,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257702497] [2022-03-03 16:40:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:40:32,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:40:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:40:32,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-03-03 16:40:32,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:40:32,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257702497] [2022-03-03 16:40:32,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257702497] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:40:32,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:40:32,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-03 16:40:32,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404271757] [2022-03-03 16:40:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:40:32,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 16:40:32,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:40:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 16:40:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 16:40:32,973 INFO L87 Difference]: Start difference. First operand 5403 states and 11060 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:40:38,034 INFO L93 Difference]: Finished difference Result 9623 states and 19779 transitions. [2022-03-03 16:40:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 16:40:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-03 16:40:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:40:38,046 INFO L225 Difference]: With dead ends: 9623 [2022-03-03 16:40:38,047 INFO L226 Difference]: Without dead ends: 9623 [2022-03-03 16:40:38,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2022-03-03 16:40:38,047 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 1656 mSDsluCounter, 10884 mSDsCounter, 0 mSdLazyCounter, 4111 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 11486 SdHoareTripleChecker+Invalid, 4152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:38,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1656 Valid, 11486 Invalid, 4152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4111 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 16:40:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9623 states. [2022-03-03 16:40:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9623 to 5405. [2022-03-03 16:40:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5405 states, 5402 states have (on average 2.048130322102925) internal successors, (11064), 5404 states have internal predecessors, (11064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 11064 transitions. [2022-03-03 16:40:38,141 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 11064 transitions. Word has length 99 [2022-03-03 16:40:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:40:38,141 INFO L470 AbstractCegarLoop]: Abstraction has 5405 states and 11064 transitions. [2022-03-03 16:40:38,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:40:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 11064 transitions. [2022-03-03 16:40:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-03 16:40:38,145 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:40:38,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:40:38,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-03-03 16:40:38,146 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-03 16:40:38,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:40:38,146 INFO L85 PathProgramCache]: Analyzing trace with hash 318954931, now seen corresponding path program 94 times [2022-03-03 16:40:38,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:40:38,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927642803] [2022-03-03 16:40:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:40:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:40:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:40:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:40:38,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:40:38,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927642803] [2022-03-03 16:40:38,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927642803] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:40:38,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:40:38,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-03 16:40:38,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321529576] [2022-03-03 16:40:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:40:38,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-03 16:40:38,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:40:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-03 16:40:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2022-03-03 16:40:38,844 INFO L87 Difference]: Start difference. First operand 5405 states and 11064 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 32 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-03 16:40:40,770 WARN L244 SmtUtils]: Removed 26 from assertion stack [2022-03-03 16:40:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 16:40:40,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=423, Invalid=1929, Unknown=0, NotChecked=0, Total=2352 [2022-03-03 16:40:40,771 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 552 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 16:40:40,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 2876 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 16:40:40,772 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-03 16:40:40,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-03-03 16:40:40,772 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (5405states) and FLOYD_HOARE automaton (currently 20 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 116 for 36ms.. [2022-03-03 16:40:40,773 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-03 16:40:40,774 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-03-03 16:40:40,774 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-03-03 16:40:40,774 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 7 remaining) [2022-03-03 16:40:40,774 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-03-03 16:40:40,774 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-03 16:40:40,776 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 16:40:40,776 INFO L732 BasicCegarLoop]: Path program histogram: [94, 24, 1, 1, 1] [2022-03-03 16:40:40,778 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 16:40:40,778 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 16:40:40,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:40:40 BasicIcfg [2022-03-03 16:40:40,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 16:40:40,781 INFO L158 Benchmark]: Toolchain (without parser) took 711593.15ms. Allocated memory was 189.8MB in the beginning and 502.3MB in the end (delta: 312.5MB). Free memory was 137.9MB in the beginning and 303.7MB in the end (delta: -165.8MB). Peak memory consumption was 147.5MB. Max. memory is 8.0GB. [2022-03-03 16:40:40,781 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 16:40:40,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.90ms. Allocated memory is still 189.8MB. Free memory was 137.7MB in the beginning and 151.8MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-03 16:40:40,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.84ms. Allocated memory is still 189.8MB. Free memory was 151.8MB in the beginning and 149.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 16:40:40,781 INFO L158 Benchmark]: Boogie Preprocessor took 32.09ms. Allocated memory is still 189.8MB. Free memory was 149.1MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 16:40:40,781 INFO L158 Benchmark]: RCFGBuilder took 334.41ms. Allocated memory is still 189.8MB. Free memory was 147.0MB in the beginning and 131.8MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-03 16:40:40,781 INFO L158 Benchmark]: TraceAbstraction took 710748.66ms. Allocated memory was 189.8MB in the beginning and 502.3MB in the end (delta: 312.5MB). Free memory was 131.3MB in the beginning and 303.7MB in the end (delta: -172.3MB). Peak memory consumption was 141.2MB. Max. memory is 8.0GB. [2022-03-03 16:40:40,781 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.10ms. Allocated memory is still 189.8MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.90ms. Allocated memory is still 189.8MB. Free memory was 137.7MB in the beginning and 151.8MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.84ms. Allocated memory is still 189.8MB. Free memory was 151.8MB in the beginning and 149.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.09ms. Allocated memory is still 189.8MB. Free memory was 149.1MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 334.41ms. Allocated memory is still 189.8MB. Free memory was 147.0MB in the beginning and 131.8MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 710748.66ms. Allocated memory was 189.8MB in the beginning and 502.3MB in the end (delta: 312.5MB). Free memory was 131.3MB in the beginning and 303.7MB in the end (delta: -172.3MB). Peak memory consumption was 141.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (5405states) and FLOYD_HOARE automaton (currently 20 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 116 for 36ms.. - TimeoutResultAtElement [Line: 836]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (5405states) and FLOYD_HOARE automaton (currently 20 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 116 for 36ms.. - TimeoutResultAtElement [Line: 837]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (5405states) and FLOYD_HOARE automaton (currently 20 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 116 for 36ms.. - TimeoutResultAtElement [Line: 854]: 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 (5405states) and FLOYD_HOARE automaton (currently 20 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 116 for 36ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 220 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 710.6s, OverallIterations: 121, TraceHistogramMax: 1, PathProgramHistogramMax: 94, EmptinessCheckTime: 0.5s, AutomataDifference: 615.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187414 SdHoareTripleChecker+Valid, 163.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187414 mSDsluCounter, 1094072 SdHoareTripleChecker+Invalid, 137.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1030909 mSDsCounter, 4407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404061 IncrementalHoareTripleChecker+Invalid, 408468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4407 mSolverCounterUnsat, 63163 mSDtfsCounter, 404061 mSolverCounterSat, 2.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9498 GetRequests, 509 SyntacticMatches, 71 SemanticMatches, 8917 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121790 ImplicationChecksByTransitivity, 484.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5935occurred in iteration=98, InterpolantAutomatonStates: 5772, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 120 MinimizatonAttempts, 277234 StatesRemovedByMinimization, 119 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 85.2s InterpolantComputationTime, 11765 NumberOfCodeBlocks, 11765 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 11644 ConstructedInterpolants, 0 QuantifiedInterpolants, 206531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 121 InterpolantComputations, 121 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