/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-44898dd
[2022-02-09 00:04:32,818 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-09 00:04:32,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-09 00:04:32,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-09 00:04:32,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-09 00:04:32,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-09 00:04:32,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-09 00:04:32,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-09 00:04:32,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-09 00:04:32,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-09 00:04:32,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-09 00:04:32,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-09 00:04:32,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-09 00:04:32,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-09 00:04:32,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-09 00:04:32,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-09 00:04:32,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-09 00:04:32,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-09 00:04:32,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-09 00:04:32,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-09 00:04:32,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-09 00:04:32,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-09 00:04:32,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-09 00:04:32,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-09 00:04:32,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-09 00:04:32,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-09 00:04:32,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-09 00:04:32,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-09 00:04:32,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-09 00:04:32,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-09 00:04:32,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-09 00:04:32,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-09 00:04:32,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-09 00:04:32,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-09 00:04:32,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-09 00:04:32,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-09 00:04:32,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-09 00:04:32,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-09 00:04:32,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-09 00:04:32,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-09 00:04:32,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-09 00:04:32,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2022-02-09 00:04:32,926 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-09 00:04:32,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-09 00:04:32,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-09 00:04:32,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-09 00:04:32,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-09 00:04:32,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-09 00:04:32,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-09 00:04:32,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-09 00:04:32,928 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-09 00:04:32,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-09 00:04:32,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-09 00:04:32,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-09 00:04:32,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-09 00:04:32,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-09 00:04:32,930 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-09 00:04:32,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-09 00:04:32,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2022-02-09 00:04:33,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-09 00:04:33,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-09 00:04:33,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-09 00:04:33,128 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-09 00:04:33,131 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-09 00:04:33,131 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-02-09 00:04:33,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dadc031b5/687d20e6a1e7456190382c6bccc0d866/FLAGa23da3614
[2022-02-09 00:04:33,529 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-09 00:04:33,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i
[2022-02-09 00:04:33,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dadc031b5/687d20e6a1e7456190382c6bccc0d866/FLAGa23da3614
[2022-02-09 00:04:33,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dadc031b5/687d20e6a1e7456190382c6bccc0d866
[2022-02-09 00:04:33,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-09 00:04:33,909 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-02-09 00:04:33,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-09 00:04:33,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-09 00:04:33,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-09 00:04:33,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 12:04:33" (1/1) ...
[2022-02-09 00:04:33,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c15406c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:33, skipping insertion in model container
[2022-02-09 00:04:33,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 12:04:33" (1/1) ...
[2022-02-09 00:04:33,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-09 00:04:33,958 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-09 00:04:34,068 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16
[2022-02-09 00:04:34,221 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-02-09 00:04:34,224 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-02-09 00:04:34,224 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-02-09 00:04:34,232 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-09 00:04:34,238 INFO L203 MainTranslator]: Completed pre-run
[2022-02-09 00:04:34,249 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16
[2022-02-09 00:04:34,271 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-02-09 00:04:34,274 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-02-09 00:04:34,275 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-02-09 00:04:34,283 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-09 00:04:34,314 INFO L208 MainTranslator]: Completed translation
[2022-02-09 00:04:34,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34 WrapperNode
[2022-02-09 00:04:34,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-09 00:04:34,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-09 00:04:34,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-09 00:04:34,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-09 00:04:34,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,348 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125
[2022-02-09 00:04:34,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-09 00:04:34,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-09 00:04:34,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-09 00:04:34,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-09 00:04:34,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-09 00:04:34,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-09 00:04:34,380 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-09 00:04:34,380 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-09 00:04:34,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (1/1) ...
[2022-02-09 00:04:34,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-09 00:04:34,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-09 00:04:34,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-02-09 00:04:34,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-02-09 00:04:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn
[2022-02-09 00:04:34,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn
[2022-02-09 00:04:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-09 00:04:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-09 00:04:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-02-09 00:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-02-09 00:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-09 00:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-09 00:04:34,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-09 00:04:34,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-09 00:04:34,464 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-02-09 00:04:34,536 INFO L234 CfgBuilder]: Building ICFG
[2022-02-09 00:04:34,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-09 00:04:34,694 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-09 00:04:34,700 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-09 00:04:34,700 INFO L299 CfgBuilder]: Removed 3 assume(true) statements.
[2022-02-09 00:04:34,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 12:04:34 BoogieIcfgContainer
[2022-02-09 00:04:34,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-09 00:04:34,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-09 00:04:34,703 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-09 00:04:34,705 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-09 00:04:34,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 12:04:33" (1/3) ...
[2022-02-09 00:04:34,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f97ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 12:04:34, skipping insertion in model container
[2022-02-09 00:04:34,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:04:34" (2/3) ...
[2022-02-09 00:04:34,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f97ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 12:04:34, skipping insertion in model container
[2022-02-09 00:04:34,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 12:04:34" (3/3) ...
[2022-02-09 00:04:34,707 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i
[2022-02-09 00:04:34,710 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-09 00:04:34,710 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-09 00:04:34,710 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2022-02-09 00:04:34,710 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-09 00:04:34,748 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,748 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,748 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,748 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,749 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,750 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,751 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,751 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,751 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,751 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,751 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,752 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,752 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,752 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,752 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,752 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,753 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,754 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,759 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,759 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,759 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,759 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,759 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,760 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,761 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,762 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,763 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,764 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,765 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,765 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,765 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,765 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,765 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,765 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,765 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,766 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,767 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,768 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,769 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,770 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,770 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,770 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,770 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,771 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,771 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,771 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,771 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,771 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,771 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,772 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,773 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,774 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,775 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,776 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,777 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,777 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,777 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,777 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,777 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,777 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,777 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,778 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,779 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,779 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,779 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,779 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,779 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,780 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,780 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,780 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,780 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,780 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,781 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,782 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,782 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,782 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,782 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,783 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,784 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,785 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,785 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,785 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,785 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,785 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,785 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,785 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,786 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,786 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,788 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,789 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,790 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,790 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,807 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,807 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,807 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,807 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,808 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-09 00:04:34,812 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2022-02-09 00:04:34,843 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-09 00:04:34,848 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2022-02-09 00:04:34,848 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2022-02-09 00:04:34,856 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 152 places, 158 transitions, 324 flow
[2022-02-09 00:04:34,942 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-02-09 00:04:34,947 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-02-09 00:04:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-02-09 00:04:34,953 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:04:34,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:04:34,954 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-02-09 00:04:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:04:34,957 INFO L85 PathProgramCache]: Analyzing trace with hash 847621616, now seen corresponding path program 1 times
[2022-02-09 00:04:34,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:04:34,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419361844]
[2022-02-09 00:04:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:04:34,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:04:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:04:35,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-02-09 00:04:35,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:04:35,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419361844]
[2022-02-09 00:04:35,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419361844] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:04:35,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:04:35,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-09 00:04:35,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090100594]
[2022-02-09 00:04:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:04:35,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-09 00:04:35,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:04:35,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-09 00:04:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-09 00:04:35,181 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-02-09 00:04:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:04:35,226 INFO L93 Difference]: Finished difference Result 2540 states and 5152 transitions.
[2022-02-09 00:04:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-09 00:04:35,228 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-02-09 00:04:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:04:35,259 INFO L225 Difference]: With dead ends: 2540
[2022-02-09 00:04:35,259 INFO L226 Difference]: Without dead ends: 2540
[2022-02-09 00:04:35,260 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-02-09 00:04:35,262 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-02-09 00:04:35,263 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-02-09 00:04:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states.
[2022-02-09 00:04:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2540.
[2022-02-09 00:04:35,352 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-02-09 00:04:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 5152 transitions.
[2022-02-09 00:04:35,360 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 5152 transitions. Word has length 40
[2022-02-09 00:04:35,361 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:04:35,361 INFO L470 AbstractCegarLoop]: Abstraction has 2540 states and 5152 transitions.
[2022-02-09 00:04:35,361 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-02-09 00:04:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 5152 transitions.
[2022-02-09 00:04:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-02-09 00:04:35,388 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:04:35,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:04:35,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-09 00:04:35,388 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-02-09 00:04:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:04:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash 506434889, now seen corresponding path program 1 times
[2022-02-09 00:04:35,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:04:35,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472110654]
[2022-02-09 00:04:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:04:35,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:04:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:04:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:04:35,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:04:35,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472110654]
[2022-02-09 00:04:35,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472110654] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:04:35,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:04:35,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-09 00:04:35,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994368999]
[2022-02-09 00:04:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:04:35,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-09 00:04:35,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:04:35,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-09 00:04:35,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-09 00:04:35,481 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-02-09 00:04:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:04:35,530 INFO L93 Difference]: Finished difference Result 4136 states and 8424 transitions.
[2022-02-09 00:04:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-09 00:04:35,531 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-02-09 00:04:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:04:35,545 INFO L225 Difference]: With dead ends: 4136
[2022-02-09 00:04:35,545 INFO L226 Difference]: Without dead ends: 4136
[2022-02-09 00:04:35,546 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-02-09 00:04:35,548 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-02-09 00:04:35,548 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-02-09 00:04:35,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states.
[2022-02-09 00:04:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 3148.
[2022-02-09 00:04:35,608 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-02-09 00:04:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 6422 transitions.
[2022-02-09 00:04:35,617 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 6422 transitions. Word has length 41
[2022-02-09 00:04:35,618 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:04:35,618 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 6422 transitions.
[2022-02-09 00:04:35,618 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-02-09 00:04:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 6422 transitions.
[2022-02-09 00:04:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2022-02-09 00:04:35,626 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:04:35,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:04:35,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-09 00:04:35,627 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-02-09 00:04:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:04:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash -654644372, now seen corresponding path program 1 times
[2022-02-09 00:04:35,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:04:35,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917532040]
[2022-02-09 00:04:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:04:35,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:04:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:04:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:04:36,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:04:36,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917532040]
[2022-02-09 00:04:36,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917532040] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:04:36,076 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:04:36,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-02-09 00:04:36,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789383075]
[2022-02-09 00:04:36,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:04:36,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-02-09 00:04:36,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:04:36,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-02-09 00:04:36,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306
[2022-02-09 00:04:36,082 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-02-09 00:04:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:04:37,429 INFO L93 Difference]: Finished difference Result 3509 states and 7163 transitions.
[2022-02-09 00:04:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-02-09 00:04:37,430 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-02-09 00:04:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:04:37,440 INFO L225 Difference]: With dead ends: 3509
[2022-02-09 00:04:37,440 INFO L226 Difference]: Without dead ends: 3353
[2022-02-09 00:04:37,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=971, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:04:37,441 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1166 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-09 00:04:37,442 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-02-09 00:04:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states.
[2022-02-09 00:04:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3088.
[2022-02-09 00:04:37,486 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-02-09 00:04:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 6311 transitions.
[2022-02-09 00:04:37,494 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 6311 transitions. Word has length 74
[2022-02-09 00:04:37,494 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:04:37,494 INFO L470 AbstractCegarLoop]: Abstraction has 3088 states and 6311 transitions.
[2022-02-09 00:04:37,494 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-02-09 00:04:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 6311 transitions.
[2022-02-09 00:04:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:04:37,497 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:04:37,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:04:37,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-09 00:04:37,498 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-02-09 00:04:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:04:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash -137095055, now seen corresponding path program 1 times
[2022-02-09 00:04:37,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:04:37,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524477333]
[2022-02-09 00:04:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:04:37,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:04:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:04:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:04:38,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:04:38,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524477333]
[2022-02-09 00:04:38,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524477333] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:04:38,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:04:38,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:04:38,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210467064]
[2022-02-09 00:04:38,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:04:38,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:04:38,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:04:38,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:04:38,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:04:38,165 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-02-09 00:04:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:04:44,053 INFO L93 Difference]: Finished difference Result 4311 states and 8834 transitions.
[2022-02-09 00:04:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:04:44,053 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-02-09 00:04:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:04:44,065 INFO L225 Difference]: With dead ends: 4311
[2022-02-09 00:04:44,065 INFO L226 Difference]: Without dead ends: 4311
[2022-02-09 00:04:44,066 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-02-09 00:04:44,067 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 1239 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:04:44,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1239 Valid, 4379 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-09 00:04:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states.
[2022-02-09 00:04:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 3439.
[2022-02-09 00:04:44,118 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-02-09 00:04:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 7037 transitions.
[2022-02-09 00:04:44,123 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 7037 transitions. Word has length 96
[2022-02-09 00:04:44,124 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:04:44,124 INFO L470 AbstractCegarLoop]: Abstraction has 3439 states and 7037 transitions.
[2022-02-09 00:04:44,124 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-02-09 00:04:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 7037 transitions.
[2022-02-09 00:04:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:04:44,129 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:04:44,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:04:44,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-09 00:04:44,131 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-02-09 00:04:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:04:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -277531331, now seen corresponding path program 2 times
[2022-02-09 00:04:44,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:04:44,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527840411]
[2022-02-09 00:04:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:04:44,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:04:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:04:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:04:44,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:04:44,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527840411]
[2022-02-09 00:04:44,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527840411] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:04:44,726 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:04:44,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:04:44,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167878293]
[2022-02-09 00:04:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:04:44,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:04:44,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:04:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:04:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:04:44,728 INFO L87 Difference]: Start difference. First operand 3439 states and 7037 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-02-09 00:04:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:04:50,379 INFO L93 Difference]: Finished difference Result 4308 states and 8822 transitions.
[2022-02-09 00:04:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states.
[2022-02-09 00:04:50,380 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-02-09 00:04:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:04:50,409 INFO L225 Difference]: With dead ends: 4308
[2022-02-09 00:04:50,409 INFO L226 Difference]: Without dead ends: 4308
[2022-02-09 00:04:50,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1434, Invalid=4116, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:04:50,411 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1298 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:04:50,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1298 Valid, 4248 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:04:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states.
[2022-02-09 00:04:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 3443.
[2022-02-09 00:04:50,464 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-02-09 00:04:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 7045 transitions.
[2022-02-09 00:04:50,471 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 7045 transitions. Word has length 96
[2022-02-09 00:04:50,471 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:04:50,471 INFO L470 AbstractCegarLoop]: Abstraction has 3443 states and 7045 transitions.
[2022-02-09 00:04:50,472 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-02-09 00:04:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 7045 transitions.
[2022-02-09 00:04:50,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:04:50,475 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:04:50,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:04:50,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-09 00:04:50,476 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-02-09 00:04:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:04:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash 641947087, now seen corresponding path program 3 times
[2022-02-09 00:04:50,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:04:50,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941661221]
[2022-02-09 00:04:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:04:50,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:04:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:04:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:04:51,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:04:51,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941661221]
[2022-02-09 00:04:51,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941661221] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:04:51,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:04:51,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:04:51,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485263648]
[2022-02-09 00:04:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:04:51,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:04:51,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:04:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:04:51,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:04:51,323 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-02-09 00:04:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:04:57,431 INFO L93 Difference]: Finished difference Result 4303 states and 8811 transitions.
[2022-02-09 00:04:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:04:57,432 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-02-09 00:04:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:04:57,443 INFO L225 Difference]: With dead ends: 4303
[2022-02-09 00:04:57,443 INFO L226 Difference]: Without dead ends: 4303
[2022-02-09 00:04:57,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1386, Invalid=3444, Unknown=0, NotChecked=0, Total=4830
[2022-02-09 00:04:57,445 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 1356 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:04:57,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1356 Valid, 4246 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-09 00:04:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states.
[2022-02-09 00:04:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3447.
[2022-02-09 00:04:57,491 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-02-09 00:04:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 7053 transitions.
[2022-02-09 00:04:57,498 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 7053 transitions. Word has length 96
[2022-02-09 00:04:57,498 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:04:57,498 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 7053 transitions.
[2022-02-09 00:04:57,498 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-02-09 00:04:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 7053 transitions.
[2022-02-09 00:04:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:04:57,501 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:04:57,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:04:57,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-09 00:04:57,502 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-02-09 00:04:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:04:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1727541067, now seen corresponding path program 4 times
[2022-02-09 00:04:57,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:04:57,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964437383]
[2022-02-09 00:04:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:04:57,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:04:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:04:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:04:58,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:04:58,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964437383]
[2022-02-09 00:04:58,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964437383] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:04:58,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:04:58,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:04:58,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243714538]
[2022-02-09 00:04:58,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:04:58,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:04:58,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:04:58,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:04:58,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:04:58,026 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-02-09 00:05:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:02,598 INFO L93 Difference]: Finished difference Result 4320 states and 8838 transitions.
[2022-02-09 00:05:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:05:02,599 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-02-09 00:05:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:02,610 INFO L225 Difference]: With dead ends: 4320
[2022-02-09 00:05:02,611 INFO L226 Difference]: Without dead ends: 4320
[2022-02-09 00:05:02,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1216, Invalid=3614, Unknown=0, NotChecked=0, Total=4830
[2022-02-09 00:05:02,620 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1181 mSDsluCounter, 4273 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:02,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 4616 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:05:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states.
[2022-02-09 00:05:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 3522.
[2022-02-09 00:05:02,735 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-02-09 00:05:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 7207 transitions.
[2022-02-09 00:05:02,742 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 7207 transitions. Word has length 96
[2022-02-09 00:05:02,742 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:02,742 INFO L470 AbstractCegarLoop]: Abstraction has 3522 states and 7207 transitions.
[2022-02-09 00:05:02,742 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-02-09 00:05:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 7207 transitions.
[2022-02-09 00:05:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:02,746 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:02,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:02,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-09 00:05:02,746 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-02-09 00:05:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash -808062649, now seen corresponding path program 5 times
[2022-02-09 00:05:02,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:02,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986810109]
[2022-02-09 00:05:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:02,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:03,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-02-09 00:05:03,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:03,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986810109]
[2022-02-09 00:05:03,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986810109] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:03,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:03,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:03,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125952093]
[2022-02-09 00:05:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:03,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:03,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:03,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:03,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:03,500 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-02-09 00:05:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:08,546 INFO L93 Difference]: Finished difference Result 4304 states and 8804 transitions.
[2022-02-09 00:05:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2022-02-09 00:05:08,547 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-02-09 00:05:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:08,553 INFO L225 Difference]: With dead ends: 4304
[2022-02-09 00:05:08,553 INFO L226 Difference]: Without dead ends: 4304
[2022-02-09 00:05:08,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1178, Invalid=2982, Unknown=0, NotChecked=0, Total=4160
[2022-02-09 00:05:08,554 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1269 mSDsluCounter, 4583 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:08,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1269 Valid, 4921 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:05:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states.
[2022-02-09 00:05:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 3720.
[2022-02-09 00:05:08,597 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-02-09 00:05:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 7619 transitions.
[2022-02-09 00:05:08,603 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 7619 transitions. Word has length 96
[2022-02-09 00:05:08,603 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:08,603 INFO L470 AbstractCegarLoop]: Abstraction has 3720 states and 7619 transitions.
[2022-02-09 00:05:08,603 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-02-09 00:05:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 7619 transitions.
[2022-02-09 00:05:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:08,606 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:08,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:08,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-09 00:05:08,607 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-02-09 00:05:08,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:08,607 INFO L85 PathProgramCache]: Analyzing trace with hash 393725621, now seen corresponding path program 6 times
[2022-02-09 00:05:08,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:08,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267857891]
[2022-02-09 00:05:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:08,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:09,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:09,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267857891]
[2022-02-09 00:05:09,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267857891] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:09,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:09,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:09,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451689162]
[2022-02-09 00:05:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:09,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:09,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:09,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:09,243 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-02-09 00:05:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:13,671 INFO L93 Difference]: Finished difference Result 4381 states and 8960 transitions.
[2022-02-09 00:05:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2022-02-09 00:05:13,672 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-02-09 00:05:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:13,678 INFO L225 Difference]: With dead ends: 4381
[2022-02-09 00:05:13,678 INFO L226 Difference]: Without dead ends: 4381
[2022-02-09 00:05:13,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1205, Invalid=3085, Unknown=0, NotChecked=0, Total=4290
[2022-02-09 00:05:13,681 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1275 mSDsluCounter, 4321 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 4662 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:13,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1275 Valid, 4662 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:05:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states.
[2022-02-09 00:05:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 3695.
[2022-02-09 00:05:13,728 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-02-09 00:05:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 7565 transitions.
[2022-02-09 00:05:13,733 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 7565 transitions. Word has length 96
[2022-02-09 00:05:13,733 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:13,734 INFO L470 AbstractCegarLoop]: Abstraction has 3695 states and 7565 transitions.
[2022-02-09 00:05:13,734 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-02-09 00:05:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 7565 transitions.
[2022-02-09 00:05:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:13,739 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:13,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:13,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-09 00:05:13,739 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-02-09 00:05:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1829581135, now seen corresponding path program 7 times
[2022-02-09 00:05:13,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:13,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310374031]
[2022-02-09 00:05:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:13,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:14,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:14,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310374031]
[2022-02-09 00:05:14,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310374031] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:14,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:14,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:14,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699424049]
[2022-02-09 00:05:14,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:14,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:14,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:14,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:14,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:14,318 INFO L87 Difference]: Start difference. First operand 3695 states and 7565 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-02-09 00:05:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:23,463 INFO L93 Difference]: Finished difference Result 4597 states and 9402 transitions.
[2022-02-09 00:05:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2022-02-09 00:05:23,464 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-02-09 00:05:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:23,470 INFO L225 Difference]: With dead ends: 4597
[2022-02-09 00:05:23,471 INFO L226 Difference]: Without dead ends: 4597
[2022-02-09 00:05:23,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2967, Invalid=7335, Unknown=0, NotChecked=0, Total=10302
[2022-02-09 00:05:23,473 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1409 mSDsluCounter, 4765 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 5152 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:23,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1409 Valid, 5152 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:05:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states.
[2022-02-09 00:05:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 3621.
[2022-02-09 00:05:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3618 states have (on average 2.0472636815920398) internal successors, (7407), 3620 states have internal predecessors, (7407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:05:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 7407 transitions.
[2022-02-09 00:05:23,522 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 7407 transitions. Word has length 96
[2022-02-09 00:05:23,522 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:23,522 INFO L470 AbstractCegarLoop]: Abstraction has 3621 states and 7407 transitions.
[2022-02-09 00:05:23,522 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-02-09 00:05:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 7407 transitions.
[2022-02-09 00:05:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:23,525 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:23,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-02-09 00:05:23,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-02-09 00:05:23,526 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-02-09 00:05:23,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1757374095, now seen corresponding path program 8 times
[2022-02-09 00:05:23,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:23,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025936902]
[2022-02-09 00:05:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:23,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:24,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:24,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025936902]
[2022-02-09 00:05:24,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025936902] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:24,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:24,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:24,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56070405]
[2022-02-09 00:05:24,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:24,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:24,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:24,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:24,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:24,045 INFO L87 Difference]: Start difference. First operand 3621 states and 7407 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-02-09 00:05:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:29,767 INFO L93 Difference]: Finished difference Result 5130 states and 10541 transitions.
[2022-02-09 00:05:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:05:29,768 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-02-09 00:05:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:29,773 INFO L225 Difference]: With dead ends: 5130
[2022-02-09 00:05:29,773 INFO L226 Difference]: Without dead ends: 5130
[2022-02-09 00:05:29,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1452, Invalid=4248, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:05:29,775 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1324 mSDsluCounter, 4231 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:29,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1324 Valid, 4576 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-09 00:05:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states.
[2022-02-09 00:05:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 3855.
[2022-02-09 00:05:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3852 states have (on average 2.0558151609553477) internal successors, (7919), 3854 states have internal predecessors, (7919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:05:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 7919 transitions.
[2022-02-09 00:05:29,823 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 7919 transitions. Word has length 96
[2022-02-09 00:05:29,823 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:29,823 INFO L470 AbstractCegarLoop]: Abstraction has 3855 states and 7919 transitions.
[2022-02-09 00:05:29,823 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-02-09 00:05:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 7919 transitions.
[2022-02-09 00:05:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:29,827 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:29,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:29,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-02-09 00:05:29,827 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-02-09 00:05:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1616937819, now seen corresponding path program 9 times
[2022-02-09 00:05:29,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:29,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551933117]
[2022-02-09 00:05:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:29,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:30,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:30,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551933117]
[2022-02-09 00:05:30,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551933117] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:30,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:30,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:30,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172734838]
[2022-02-09 00:05:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:30,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:30,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:30,369 INFO L87 Difference]: Start difference. First operand 3855 states and 7919 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-02-09 00:05:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:35,891 INFO L93 Difference]: Finished difference Result 5127 states and 10529 transitions.
[2022-02-09 00:05:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states.
[2022-02-09 00:05:35,891 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-02-09 00:05:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:35,897 INFO L225 Difference]: With dead ends: 5127
[2022-02-09 00:05:35,897 INFO L226 Difference]: Without dead ends: 5127
[2022-02-09 00:05:35,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1433, Invalid=4117, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:05:35,901 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1250 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 4416 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:35,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 4416 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:05:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states.
[2022-02-09 00:05:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 3859.
[2022-02-09 00:05:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3856 states have (on average 2.0557572614107884) internal successors, (7927), 3858 states have internal predecessors, (7927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:05:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 7927 transitions.
[2022-02-09 00:05:36,001 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 7927 transitions. Word has length 96
[2022-02-09 00:05:36,001 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:36,001 INFO L470 AbstractCegarLoop]: Abstraction has 3859 states and 7927 transitions.
[2022-02-09 00:05:36,001 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-02-09 00:05:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 7927 transitions.
[2022-02-09 00:05:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:36,023 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:36,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:36,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-09 00:05:36,024 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-02-09 00:05:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:36,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1758551059, now seen corresponding path program 10 times
[2022-02-09 00:05:36,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:36,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475757595]
[2022-02-09 00:05:36,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:36,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:36,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:36,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475757595]
[2022-02-09 00:05:36,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475757595] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:36,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:36,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:36,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121934036]
[2022-02-09 00:05:36,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:36,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:36,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:36,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:36,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:36,544 INFO L87 Difference]: Start difference. First operand 3859 states and 7927 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-02-09 00:05:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:41,909 INFO L93 Difference]: Finished difference Result 5168 states and 10612 transitions.
[2022-02-09 00:05:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:05:41,909 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-02-09 00:05:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:41,918 INFO L225 Difference]: With dead ends: 5168
[2022-02-09 00:05:41,919 INFO L226 Difference]: Without dead ends: 5168
[2022-02-09 00:05:41,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1386, Invalid=3444, Unknown=0, NotChecked=0, Total=4830
[2022-02-09 00:05:41,923 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 1344 mSDsluCounter, 4179 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:41,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1344 Valid, 4530 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:05:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states.
[2022-02-09 00:05:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3870.
[2022-02-09 00:05:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3867 states have (on average 2.055598655288337) internal successors, (7949), 3869 states have internal predecessors, (7949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:05:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 7949 transitions.
[2022-02-09 00:05:41,993 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 7949 transitions. Word has length 96
[2022-02-09 00:05:41,993 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:41,993 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 7949 transitions.
[2022-02-09 00:05:41,993 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-02-09 00:05:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 7949 transitions.
[2022-02-09 00:05:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:41,997 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:41,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:41,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-02-09 00:05:41,997 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-02-09 00:05:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash 166928083, now seen corresponding path program 11 times
[2022-02-09 00:05:41,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:41,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411981152]
[2022-02-09 00:05:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:41,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:42,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:42,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411981152]
[2022-02-09 00:05:42,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411981152] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:42,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:42,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:42,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189362309]
[2022-02-09 00:05:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:42,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:42,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:42,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:42,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:42,752 INFO L87 Difference]: Start difference. First operand 3870 states and 7949 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-02-09 00:05:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:48,034 INFO L93 Difference]: Finished difference Result 5042 states and 10344 transitions.
[2022-02-09 00:05:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:05:48,035 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-02-09 00:05:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:48,040 INFO L225 Difference]: With dead ends: 5042
[2022-02-09 00:05:48,040 INFO L226 Difference]: Without dead ends: 5042
[2022-02-09 00:05:48,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1215, Invalid=3615, Unknown=0, NotChecked=0, Total=4830
[2022-02-09 00:05:48,041 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 1209 mSDsluCounter, 4611 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:48,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1209 Valid, 4963 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:05:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states.
[2022-02-09 00:05:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 3922.
[2022-02-09 00:05:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3919 states have (on average 2.054605766777239) internal successors, (8052), 3921 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:05:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 8052 transitions.
[2022-02-09 00:05:48,108 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 8052 transitions. Word has length 96
[2022-02-09 00:05:48,109 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:48,109 INFO L470 AbstractCegarLoop]: Abstraction has 3922 states and 8052 transitions.
[2022-02-09 00:05:48,109 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-02-09 00:05:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 8052 transitions.
[2022-02-09 00:05:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:48,112 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:48,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:48,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-02-09 00:05:48,113 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-02-09 00:05:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1086406501, now seen corresponding path program 12 times
[2022-02-09 00:05:48,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:48,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133479371]
[2022-02-09 00:05:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:48,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:48,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:48,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133479371]
[2022-02-09 00:05:48,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133479371] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:48,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:48,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:48,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617474039]
[2022-02-09 00:05:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:48,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:48,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:48,674 INFO L87 Difference]: Start difference. First operand 3922 states and 8052 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-02-09 00:05:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:53,533 INFO L93 Difference]: Finished difference Result 5004 states and 10266 transitions.
[2022-02-09 00:05:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2022-02-09 00:05:53,533 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-02-09 00:05:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:53,553 INFO L225 Difference]: With dead ends: 5004
[2022-02-09 00:05:53,553 INFO L226 Difference]: Without dead ends: 5004
[2022-02-09 00:05:53,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1179, Invalid=2981, Unknown=0, NotChecked=0, Total=4160
[2022-02-09 00:05:53,557 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1193 mSDsluCounter, 3893 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 4240 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:53,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 4240 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:05:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5004 states.
[2022-02-09 00:05:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5004 to 3915.
[2022-02-09 00:05:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3912 states have (on average 2.0501022494887526) internal successors, (8020), 3914 states have internal predecessors, (8020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:05:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 8020 transitions.
[2022-02-09 00:05:53,601 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 8020 transitions. Word has length 96
[2022-02-09 00:05:53,602 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:53,602 INFO L470 AbstractCegarLoop]: Abstraction has 3915 states and 8020 transitions.
[2022-02-09 00:05:53,602 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-02-09 00:05:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 8020 transitions.
[2022-02-09 00:05:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:53,605 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:53,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:53,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-02-09 00:05:53,605 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-02-09 00:05:53,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2006772525, now seen corresponding path program 13 times
[2022-02-09 00:05:53,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:53,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394574268]
[2022-02-09 00:05:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:53,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:54,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:54,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394574268]
[2022-02-09 00:05:54,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394574268] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:54,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:54,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:54,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740893958]
[2022-02-09 00:05:54,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:54,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:54,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:54,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:54,252 INFO L87 Difference]: Start difference. First operand 3915 states and 8020 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-02-09 00:05:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:05:59,116 INFO L93 Difference]: Finished difference Result 5041 states and 10334 transitions.
[2022-02-09 00:05:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2022-02-09 00:05:59,116 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-02-09 00:05:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:05:59,122 INFO L225 Difference]: With dead ends: 5041
[2022-02-09 00:05:59,122 INFO L226 Difference]: Without dead ends: 5041
[2022-02-09 00:05:59,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1203, Invalid=3087, Unknown=0, NotChecked=0, Total=4290
[2022-02-09 00:05:59,123 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1171 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:05:59,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 4846 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-09 00:05:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states.
[2022-02-09 00:05:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 3915.
[2022-02-09 00:05:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3912 states have (on average 2.0501022494887526) internal successors, (8020), 3914 states have internal predecessors, (8020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:05:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 8020 transitions.
[2022-02-09 00:05:59,170 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 8020 transitions. Word has length 96
[2022-02-09 00:05:59,170 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:05:59,170 INFO L470 AbstractCegarLoop]: Abstraction has 3915 states and 8020 transitions.
[2022-02-09 00:05:59,170 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-02-09 00:05:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 8020 transitions.
[2022-02-09 00:05:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:05:59,174 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:05:59,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:05:59,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-02-09 00:05:59,175 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-02-09 00:05:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:05:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash -570917011, now seen corresponding path program 14 times
[2022-02-09 00:05:59,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:05:59,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352394240]
[2022-02-09 00:05:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:05:59,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:05:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:05:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:05:59,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:05:59,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352394240]
[2022-02-09 00:05:59,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352394240] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:05:59,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:05:59,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:05:59,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391398863]
[2022-02-09 00:05:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:05:59,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:05:59,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:05:59,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:05:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:05:59,725 INFO L87 Difference]: Start difference. First operand 3915 states and 8020 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-02-09 00:06:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:09,809 INFO L93 Difference]: Finished difference Result 5536 states and 11345 transitions.
[2022-02-09 00:06:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states.
[2022-02-09 00:06:09,810 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-02-09 00:06:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:09,815 INFO L225 Difference]: With dead ends: 5536
[2022-02-09 00:06:09,815 INFO L226 Difference]: Without dead ends: 5536
[2022-02-09 00:06:09,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3768, Invalid=9342, Unknown=0, NotChecked=0, Total=13110
[2022-02-09 00:06:09,816 INFO L933 BasicCegarLoop]: 464 mSDtfsCounter, 1502 mSDsluCounter, 4732 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 5196 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:09,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 5196 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:06:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5536 states.
[2022-02-09 00:06:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5536 to 3915.
[2022-02-09 00:06:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3912 states have (on average 2.0501022494887526) internal successors, (8020), 3914 states have internal predecessors, (8020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 8020 transitions.
[2022-02-09 00:06:09,863 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 8020 transitions. Word has length 96
[2022-02-09 00:06:09,863 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:09,863 INFO L470 AbstractCegarLoop]: Abstraction has 3915 states and 8020 transitions.
[2022-02-09 00:06:09,863 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-02-09 00:06:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 8020 transitions.
[2022-02-09 00:06:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:09,867 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:09,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:09,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-02-09 00:06:09,867 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-02-09 00:06:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2037360013, now seen corresponding path program 15 times
[2022-02-09 00:06:09,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:09,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663481570]
[2022-02-09 00:06:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:09,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:06:10,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:10,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663481570]
[2022-02-09 00:06:10,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663481570] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:10,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:10,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2022-02-09 00:06:10,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670354962]
[2022-02-09 00:06:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:10,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-02-09 00:06:10,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-02-09 00:06:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650
[2022-02-09 00:06:10,350 INFO L87 Difference]: Start difference. First operand 3915 states and 8020 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-02-09 00:06:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:18,365 INFO L93 Difference]: Finished difference Result 5069 states and 10377 transitions.
[2022-02-09 00:06:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states.
[2022-02-09 00:06:18,370 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-02-09 00:06:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:18,375 INFO L225 Difference]: With dead ends: 5069
[2022-02-09 00:06:18,375 INFO L226 Difference]: Without dead ends: 5069
[2022-02-09 00:06:18,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3334, Invalid=8222, Unknown=0, NotChecked=0, Total=11556
[2022-02-09 00:06:18,377 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 1478 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 4941 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:18,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 4941 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-09 00:06:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states.
[2022-02-09 00:06:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 3548.
[2022-02-09 00:06:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3548 states, 3545 states have (on average 2.045416078984485) internal successors, (7251), 3547 states have internal predecessors, (7251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 7251 transitions.
[2022-02-09 00:06:18,412 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 7251 transitions. Word has length 96
[2022-02-09 00:06:18,412 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:18,412 INFO L470 AbstractCegarLoop]: Abstraction has 3548 states and 7251 transitions.
[2022-02-09 00:06:18,412 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-02-09 00:06:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 7251 transitions.
[2022-02-09 00:06:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:18,415 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:18,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:18,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-02-09 00:06:18,415 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-02-09 00:06:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash 155436657, now seen corresponding path program 16 times
[2022-02-09 00:06:18,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:18,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921473831]
[2022-02-09 00:06:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:18,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:06:18,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:18,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921473831]
[2022-02-09 00:06:18,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921473831] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:18,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:18,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:06:18,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116125088]
[2022-02-09 00:06:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:18,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:06:18,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:18,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:06:18,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:06:18,941 INFO L87 Difference]: Start difference. First operand 3548 states and 7251 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-02-09 00:06:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:22,841 INFO L93 Difference]: Finished difference Result 4667 states and 9586 transitions.
[2022-02-09 00:06:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:06:22,859 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-02-09 00:06:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:22,864 INFO L225 Difference]: With dead ends: 4667
[2022-02-09 00:06:22,864 INFO L226 Difference]: Without dead ends: 4667
[2022-02-09 00:06:22,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1451, Invalid=4249, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:06:22,865 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1379 mSDsluCounter, 4608 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 4946 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:22,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1379 Valid, 4946 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-02-09 00:06:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states.
[2022-02-09 00:06:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 3772.
[2022-02-09 00:06:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3772 states, 3769 states have (on average 2.0543910851684797) internal successors, (7743), 3771 states have internal predecessors, (7743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 7743 transitions.
[2022-02-09 00:06:22,919 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 7743 transitions. Word has length 96
[2022-02-09 00:06:22,919 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:22,919 INFO L470 AbstractCegarLoop]: Abstraction has 3772 states and 7743 transitions.
[2022-02-09 00:06:22,919 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-02-09 00:06:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 7743 transitions.
[2022-02-09 00:06:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:22,922 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:22,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:22,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-02-09 00:06:22,922 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-02-09 00:06:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:22,923 INFO L85 PathProgramCache]: Analyzing trace with hash 15000381, now seen corresponding path program 17 times
[2022-02-09 00:06:22,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:22,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915709044]
[2022-02-09 00:06:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:22,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:06:23,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:23,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915709044]
[2022-02-09 00:06:23,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915709044] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:23,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:23,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:06:23,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753376183]
[2022-02-09 00:06:23,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:23,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:06:23,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:23,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:06:23,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:06:23,472 INFO L87 Difference]: Start difference. First operand 3772 states and 7743 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-02-09 00:06:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:28,432 INFO L93 Difference]: Finished difference Result 4664 states and 9574 transitions.
[2022-02-09 00:06:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states.
[2022-02-09 00:06:28,433 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-02-09 00:06:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:28,437 INFO L225 Difference]: With dead ends: 4664
[2022-02-09 00:06:28,437 INFO L226 Difference]: Without dead ends: 4664
[2022-02-09 00:06:28,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1432, Invalid=4118, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:06:28,439 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1186 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5109 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:28,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1186 Valid, 5109 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:06:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states.
[2022-02-09 00:06:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 3776.
[2022-02-09 00:06:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3773 states have (on average 2.0543334216803606) internal successors, (7751), 3775 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 7751 transitions.
[2022-02-09 00:06:28,477 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 7751 transitions. Word has length 96
[2022-02-09 00:06:28,477 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:28,477 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 7751 transitions.
[2022-02-09 00:06:28,477 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-02-09 00:06:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 7751 transitions.
[2022-02-09 00:06:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:28,480 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:28,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:28,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-02-09 00:06:28,481 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-02-09 00:06:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash 934478799, now seen corresponding path program 18 times
[2022-02-09 00:06:28,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:28,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258373666]
[2022-02-09 00:06:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:28,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:06:29,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:29,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258373666]
[2022-02-09 00:06:29,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258373666] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:29,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:29,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:06:29,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057487847]
[2022-02-09 00:06:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:29,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:06:29,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:06:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:06:29,141 INFO L87 Difference]: Start difference. First operand 3776 states and 7751 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-02-09 00:06:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:33,560 INFO L93 Difference]: Finished difference Result 4659 states and 9563 transitions.
[2022-02-09 00:06:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:06:33,560 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-02-09 00:06:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:33,565 INFO L225 Difference]: With dead ends: 4659
[2022-02-09 00:06:33,565 INFO L226 Difference]: Without dead ends: 4659
[2022-02-09 00:06:33,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1384, Invalid=3446, Unknown=0, NotChecked=0, Total=4830
[2022-02-09 00:06:33,566 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1448 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 4462 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:33,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1448 Valid, 4462 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-02-09 00:06:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states.
[2022-02-09 00:06:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3780.
[2022-02-09 00:06:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3777 states have (on average 2.0542758803283028) internal successors, (7759), 3779 states have internal predecessors, (7759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 7759 transitions.
[2022-02-09 00:06:33,603 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 7759 transitions. Word has length 96
[2022-02-09 00:06:33,603 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:33,603 INFO L470 AbstractCegarLoop]: Abstraction has 3780 states and 7759 transitions.
[2022-02-09 00:06:33,603 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-02-09 00:06:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 7759 transitions.
[2022-02-09 00:06:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:33,606 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:33,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:33,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-02-09 00:06:33,607 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-02-09 00:06:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1435009355, now seen corresponding path program 19 times
[2022-02-09 00:06:33,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:33,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156511340]
[2022-02-09 00:06:33,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:33,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:34,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-02-09 00:06:34,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:34,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156511340]
[2022-02-09 00:06:34,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156511340] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:34,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:34,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:06:34,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273518432]
[2022-02-09 00:06:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:34,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:06:34,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:06:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:06:34,021 INFO L87 Difference]: Start difference. First operand 3780 states and 7759 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-02-09 00:06:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:37,397 INFO L93 Difference]: Finished difference Result 4576 states and 9383 transitions.
[2022-02-09 00:06:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:06:37,397 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-02-09 00:06:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:37,401 INFO L225 Difference]: With dead ends: 4576
[2022-02-09 00:06:37,401 INFO L226 Difference]: Without dead ends: 4576
[2022-02-09 00:06:37,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1214, Invalid=3616, Unknown=0, NotChecked=0, Total=4830
[2022-02-09 00:06:37,403 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1254 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 5122 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:37,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1254 Valid, 5122 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-02-09 00:06:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states.
[2022-02-09 00:06:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 3832.
[2022-02-09 00:06:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3829 states have (on average 2.0532776181770696) internal successors, (7862), 3831 states have internal predecessors, (7862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 7862 transitions.
[2022-02-09 00:06:37,458 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 7862 transitions. Word has length 96
[2022-02-09 00:06:37,458 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:37,458 INFO L470 AbstractCegarLoop]: Abstraction has 3832 states and 7862 transitions.
[2022-02-09 00:06:37,458 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-02-09 00:06:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 7862 transitions.
[2022-02-09 00:06:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:37,473 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:37,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:37,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-02-09 00:06:37,473 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-02-09 00:06:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash -515530937, now seen corresponding path program 20 times
[2022-02-09 00:06:37,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:37,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787231514]
[2022-02-09 00:06:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:37,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:06:38,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:38,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787231514]
[2022-02-09 00:06:38,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787231514] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:38,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:38,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:06:38,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209029614]
[2022-02-09 00:06:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:38,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:06:38,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:38,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:06:38,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:06:38,183 INFO L87 Difference]: Start difference. First operand 3832 states and 7862 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-02-09 00:06:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:42,868 INFO L93 Difference]: Finished difference Result 4514 states and 9255 transitions.
[2022-02-09 00:06:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2022-02-09 00:06:42,868 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-02-09 00:06:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:42,872 INFO L225 Difference]: With dead ends: 4514
[2022-02-09 00:06:42,872 INFO L226 Difference]: Without dead ends: 4514
[2022-02-09 00:06:42,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1176, Invalid=2984, Unknown=0, NotChecked=0, Total=4160
[2022-02-09 00:06:42,873 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1335 mSDsluCounter, 4458 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 4798 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:42,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1335 Valid, 4798 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:06:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states.
[2022-02-09 00:06:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 3787.
[2022-02-09 00:06:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3787 states, 3784 states have (on average 2.049154334038055) internal successors, (7754), 3786 states have internal predecessors, (7754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3787 states and 7754 transitions.
[2022-02-09 00:06:42,910 INFO L78 Accepts]: Start accepts. Automaton has 3787 states and 7754 transitions. Word has length 96
[2022-02-09 00:06:42,910 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:42,910 INFO L470 AbstractCegarLoop]: Abstraction has 3787 states and 7754 transitions.
[2022-02-09 00:06:42,910 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-02-09 00:06:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 7754 transitions.
[2022-02-09 00:06:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:42,913 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:42,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:42,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-02-09 00:06:42,913 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-02-09 00:06:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash 686257333, now seen corresponding path program 21 times
[2022-02-09 00:06:42,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:42,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454974975]
[2022-02-09 00:06:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:42,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:06:43,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:43,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454974975]
[2022-02-09 00:06:43,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454974975] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:43,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:43,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:06:43,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202605691]
[2022-02-09 00:06:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:43,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:06:43,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:43,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:06:43,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:06:43,520 INFO L87 Difference]: Start difference. First operand 3787 states and 7754 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-02-09 00:06:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:49,110 INFO L93 Difference]: Finished difference Result 4578 states and 9379 transitions.
[2022-02-09 00:06:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2022-02-09 00:06:49,111 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-02-09 00:06:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:49,115 INFO L225 Difference]: With dead ends: 4578
[2022-02-09 00:06:49,115 INFO L226 Difference]: Without dead ends: 4578
[2022-02-09 00:06:49,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1203, Invalid=3087, Unknown=0, NotChecked=0, Total=4290
[2022-02-09 00:06:49,116 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1164 mSDsluCounter, 4268 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4611 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:49,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 4611 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-09 00:06:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states.
[2022-02-09 00:06:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 3870.
[2022-02-09 00:06:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3867 states have (on average 2.048616498577709) internal successors, (7922), 3869 states have internal predecessors, (7922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 7922 transitions.
[2022-02-09 00:06:49,157 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 7922 transitions. Word has length 96
[2022-02-09 00:06:49,157 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:49,157 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 7922 transitions.
[2022-02-09 00:06:49,157 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-02-09 00:06:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 7922 transitions.
[2022-02-09 00:06:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:49,160 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:49,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:49,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-02-09 00:06:49,161 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-02-09 00:06:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2122112847, now seen corresponding path program 22 times
[2022-02-09 00:06:49,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:49,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602211638]
[2022-02-09 00:06:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:49,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:06:49,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:49,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602211638]
[2022-02-09 00:06:49,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602211638] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:49,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:49,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-02-09 00:06:49,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940026291]
[2022-02-09 00:06:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:49,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-02-09 00:06:49,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-02-09 00:06:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702
[2022-02-09 00:06:49,670 INFO L87 Difference]: Start difference. First operand 3870 states and 7922 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-02-09 00:06:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:06:55,171 INFO L93 Difference]: Finished difference Result 4697 states and 9619 transitions.
[2022-02-09 00:06:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2022-02-09 00:06:55,171 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-02-09 00:06:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:06:55,176 INFO L225 Difference]: With dead ends: 4697
[2022-02-09 00:06:55,176 INFO L226 Difference]: Without dead ends: 4697
[2022-02-09 00:06:55,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1280, Invalid=3142, Unknown=0, NotChecked=0, Total=4422
[2022-02-09 00:06:55,177 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1199 mSDsluCounter, 4456 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 4806 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:06:55,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1199 Valid, 4806 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-09 00:06:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states.
[2022-02-09 00:06:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3886.
[2022-02-09 00:06:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3883 states have (on average 2.0484161730620656) internal successors, (7954), 3885 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:06:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 7954 transitions.
[2022-02-09 00:06:55,221 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 7954 transitions. Word has length 96
[2022-02-09 00:06:55,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:06:55,222 INFO L470 AbstractCegarLoop]: Abstraction has 3886 states and 7954 transitions.
[2022-02-09 00:06:55,222 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-02-09 00:06:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 7954 transitions.
[2022-02-09 00:06:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:06:55,225 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:06:55,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:06:55,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-02-09 00:06:55,225 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-02-09 00:06:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:06:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 435422575, now seen corresponding path program 23 times
[2022-02-09 00:06:55,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:06:55,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598915419]
[2022-02-09 00:06:55,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:06:55,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:06:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:06:55,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-02-09 00:06:55,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:06:55,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598915419]
[2022-02-09 00:06:55,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598915419] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:06:55,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:06:55,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2022-02-09 00:06:55,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817985204]
[2022-02-09 00:06:55,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:06:55,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-02-09 00:06:55,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:06:55,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-02-09 00:06:55,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650
[2022-02-09 00:06:55,634 INFO L87 Difference]: Start difference. First operand 3886 states and 7954 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-02-09 00:07:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:05,954 INFO L93 Difference]: Finished difference Result 4940 states and 10114 transitions.
[2022-02-09 00:07:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states.
[2022-02-09 00:07:05,954 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-02-09 00:07:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:05,959 INFO L225 Difference]: With dead ends: 4940
[2022-02-09 00:07:05,959 INFO L226 Difference]: Without dead ends: 4940
[2022-02-09 00:07:05,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2466 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=4244, Invalid=10518, Unknown=0, NotChecked=0, Total=14762
[2022-02-09 00:07:05,961 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 1290 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:05,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1290 Valid, 5001 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:07:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states.
[2022-02-09 00:07:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 3548.
[2022-02-09 00:07:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3548 states, 3545 states have (on average 2.045416078984485) internal successors, (7251), 3547 states have internal predecessors, (7251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 7251 transitions.
[2022-02-09 00:07:06,002 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 7251 transitions. Word has length 96
[2022-02-09 00:07:06,002 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:06,002 INFO L470 AbstractCegarLoop]: Abstraction has 3548 states and 7251 transitions.
[2022-02-09 00:07:06,002 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-02-09 00:07:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 7251 transitions.
[2022-02-09 00:07:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2022-02-09 00:07:06,006 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:06,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]
[2022-02-09 00:07:06,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2022-02-09 00:07:06,006 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-02-09 00:07:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1424536301, now seen corresponding path program 24 times
[2022-02-09 00:07:06,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:06,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732008762]
[2022-02-09 00:07:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:06,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:06,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:06,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732008762]
[2022-02-09 00:07:06,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732008762] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:06,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:06,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2022-02-09 00:07:06,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362135714]
[2022-02-09 00:07:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:06,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-02-09 00:07:06,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:06,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-02-09 00:07:06,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650
[2022-02-09 00:07:06,609 INFO L87 Difference]: Start difference. First operand 3548 states and 7251 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-02-09 00:07:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:15,395 INFO L93 Difference]: Finished difference Result 4198 states and 8572 transitions.
[2022-02-09 00:07:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states.
[2022-02-09 00:07:15,395 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-02-09 00:07:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:15,399 INFO L225 Difference]: With dead ends: 4198
[2022-02-09 00:07:15,399 INFO L226 Difference]: Without dead ends: 4198
[2022-02-09 00:07:15,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3743, Invalid=9367, Unknown=0, NotChecked=0, Total=13110
[2022-02-09 00:07:15,400 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 1422 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:15,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1422 Valid, 4135 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-09 00:07:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states.
[2022-02-09 00:07:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 3151.
[2022-02-09 00:07:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3151 states, 3148 states have (on average 2.0447903430749683) internal successors, (6437), 3150 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 6437 transitions.
[2022-02-09 00:07:15,428 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 6437 transitions. Word has length 96
[2022-02-09 00:07:15,428 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:15,428 INFO L470 AbstractCegarLoop]: Abstraction has 3151 states and 6437 transitions.
[2022-02-09 00:07:15,428 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-02-09 00:07:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 6437 transitions.
[2022-02-09 00:07:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:15,430 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:15,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-02-09 00:07:15,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2022-02-09 00:07:15,431 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-02-09 00:07:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash -409774949, now seen corresponding path program 1 times
[2022-02-09 00:07:15,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:15,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636054920]
[2022-02-09 00:07:15,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:15,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:16,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:16,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636054920]
[2022-02-09 00:07:16,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636054920] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:16,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:16,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:07:16,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616193169]
[2022-02-09 00:07:16,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:16,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:07:16,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:16,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:07:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:07:16,458 INFO L87 Difference]: Start difference. First operand 3151 states and 6437 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-02-09 00:07:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:21,564 INFO L93 Difference]: Finished difference Result 6181 states and 12714 transitions.
[2022-02-09 00:07:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:07:21,565 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-02-09 00:07:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:21,571 INFO L225 Difference]: With dead ends: 6181
[2022-02-09 00:07:21,571 INFO L226 Difference]: Without dead ends: 6181
[2022-02-09 00:07:21,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1408, Invalid=7148, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:07:21,572 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 2117 mSDsluCounter, 9405 mSDsCounter, 0 mSdLazyCounter, 3686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2117 SdHoareTripleChecker+Valid, 9934 SdHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:21,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2117 Valid, 9934 Invalid, 3743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3686 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:07:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6181 states.
[2022-02-09 00:07:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6181 to 4658.
[2022-02-09 00:07:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4658 states, 4655 states have (on average 2.05671321160043) internal successors, (9574), 4657 states have internal predecessors, (9574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 9574 transitions.
[2022-02-09 00:07:21,677 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 9574 transitions. Word has length 99
[2022-02-09 00:07:21,677 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:21,677 INFO L470 AbstractCegarLoop]: Abstraction has 4658 states and 9574 transitions.
[2022-02-09 00:07:21,677 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-02-09 00:07:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 9574 transitions.
[2022-02-09 00:07:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:21,687 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:21,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-02-09 00:07:21,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2022-02-09 00:07:21,688 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-02-09 00:07:21,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 692291031, now seen corresponding path program 2 times
[2022-02-09 00:07:21,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:21,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408957239]
[2022-02-09 00:07:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:21,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:22,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:22,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408957239]
[2022-02-09 00:07:22,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408957239] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:22,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:22,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:07:22,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515317927]
[2022-02-09 00:07:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:22,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:07:22,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:07:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:07:22,534 INFO L87 Difference]: Start difference. First operand 4658 states and 9574 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-02-09 00:07:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:26,535 INFO L93 Difference]: Finished difference Result 6614 states and 13584 transitions.
[2022-02-09 00:07:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:07:26,535 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-02-09 00:07:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:26,541 INFO L225 Difference]: With dead ends: 6614
[2022-02-09 00:07:26,541 INFO L226 Difference]: Without dead ends: 6614
[2022-02-09 00:07:26,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:07:26,542 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 1629 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 9084 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:26,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1629 Valid, 9084 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:07:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6614 states.
[2022-02-09 00:07:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6614 to 4576.
[2022-02-09 00:07:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 4573 states have (on average 2.0502952110212114) internal successors, (9376), 4575 states have internal predecessors, (9376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 9376 transitions.
[2022-02-09 00:07:26,587 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 9376 transitions. Word has length 99
[2022-02-09 00:07:26,588 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:26,589 INFO L470 AbstractCegarLoop]: Abstraction has 4576 states and 9376 transitions.
[2022-02-09 00:07:26,589 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-02-09 00:07:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 9376 transitions.
[2022-02-09 00:07:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:26,592 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:26,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:07:26,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2022-02-09 00:07:26,593 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-02-09 00:07:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash -502418461, now seen corresponding path program 3 times
[2022-02-09 00:07:26,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:26,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68062369]
[2022-02-09 00:07:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:26,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:27,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:27,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68062369]
[2022-02-09 00:07:27,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68062369] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:27,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:27,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:07:27,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221340195]
[2022-02-09 00:07:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:27,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:07:27,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:07:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:07:27,392 INFO L87 Difference]: Start difference. First operand 4576 states and 9376 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-02-09 00:07:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:32,350 INFO L93 Difference]: Finished difference Result 7486 states and 15358 transitions.
[2022-02-09 00:07:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:07:32,350 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-02-09 00:07:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:32,357 INFO L225 Difference]: With dead ends: 7486
[2022-02-09 00:07:32,357 INFO L226 Difference]: Without dead ends: 7486
[2022-02-09 00:07:32,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1067, Invalid=5095, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:07:32,359 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1910 mSDsluCounter, 8880 mSDsCounter, 0 mSdLazyCounter, 3183 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 9460 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:32,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1910 Valid, 9460 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3183 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:07:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7486 states.
[2022-02-09 00:07:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7486 to 4636.
[2022-02-09 00:07:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4633 states have (on average 2.0500755450032377) internal successors, (9498), 4635 states have internal predecessors, (9498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 9498 transitions.
[2022-02-09 00:07:32,405 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 9498 transitions. Word has length 99
[2022-02-09 00:07:32,406 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:32,406 INFO L470 AbstractCegarLoop]: Abstraction has 4636 states and 9498 transitions.
[2022-02-09 00:07:32,406 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-02-09 00:07:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 9498 transitions.
[2022-02-09 00:07:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:32,409 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:32,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:07:32,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2022-02-09 00:07:32,409 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-02-09 00:07:32,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:32,409 INFO L85 PathProgramCache]: Analyzing trace with hash 704750963, now seen corresponding path program 4 times
[2022-02-09 00:07:32,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:32,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277412475]
[2022-02-09 00:07:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:32,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:33,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:33,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277412475]
[2022-02-09 00:07:33,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277412475] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:33,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:33,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:07:33,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502498259]
[2022-02-09 00:07:33,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:33,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:07:33,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:07:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:07:33,174 INFO L87 Difference]: Start difference. First operand 4636 states and 9498 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-02-09 00:07:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:37,508 INFO L93 Difference]: Finished difference Result 6454 states and 13227 transitions.
[2022-02-09 00:07:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:07:37,508 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-02-09 00:07:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:37,515 INFO L225 Difference]: With dead ends: 6454
[2022-02-09 00:07:37,515 INFO L226 Difference]: Without dead ends: 6454
[2022-02-09 00:07:37,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=941, Invalid=4609, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:07:37,516 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1644 mSDsluCounter, 9968 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 10530 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:37,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1644 Valid, 10530 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:07:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6454 states.
[2022-02-09 00:07:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6454 to 4636.
[2022-02-09 00:07:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4633 states have (on average 2.0500755450032377) internal successors, (9498), 4635 states have internal predecessors, (9498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 9498 transitions.
[2022-02-09 00:07:37,567 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 9498 transitions. Word has length 99
[2022-02-09 00:07:37,567 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:37,567 INFO L470 AbstractCegarLoop]: Abstraction has 4636 states and 9498 transitions.
[2022-02-09 00:07:37,568 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-02-09 00:07:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 9498 transitions.
[2022-02-09 00:07:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:37,571 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:37,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:07:37,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2022-02-09 00:07:37,571 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-02-09 00:07:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1980365383, now seen corresponding path program 5 times
[2022-02-09 00:07:37,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:37,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080631208]
[2022-02-09 00:07:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:37,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:38,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:38,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080631208]
[2022-02-09 00:07:38,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080631208] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:38,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:38,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:07:38,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090388054]
[2022-02-09 00:07:38,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:38,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:07:38,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:07:38,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:07:38,489 INFO L87 Difference]: Start difference. First operand 4636 states and 9498 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-02-09 00:07:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:41,854 INFO L93 Difference]: Finished difference Result 6539 states and 13414 transitions.
[2022-02-09 00:07:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:07:41,854 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-02-09 00:07:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:41,861 INFO L225 Difference]: With dead ends: 6539
[2022-02-09 00:07:41,861 INFO L226 Difference]: Without dead ends: 6539
[2022-02-09 00:07:41,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:07:41,861 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1662 mSDsluCounter, 8914 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 9466 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:41,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1662 Valid, 9466 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:07:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states.
[2022-02-09 00:07:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 4653.
[2022-02-09 00:07:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4650 states have (on average 2.0498924731182795) internal successors, (9532), 4652 states have internal predecessors, (9532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 9532 transitions.
[2022-02-09 00:07:41,904 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 9532 transitions. Word has length 99
[2022-02-09 00:07:41,905 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:41,905 INFO L470 AbstractCegarLoop]: Abstraction has 4653 states and 9532 transitions.
[2022-02-09 00:07:41,905 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-02-09 00:07:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 9532 transitions.
[2022-02-09 00:07:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:41,908 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:41,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:07:41,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2022-02-09 00:07:41,909 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-02-09 00:07:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash 132152027, now seen corresponding path program 6 times
[2022-02-09 00:07:41,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:41,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845062769]
[2022-02-09 00:07:41,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:41,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:42,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:42,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845062769]
[2022-02-09 00:07:42,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845062769] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:42,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:42,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:07:42,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494564545]
[2022-02-09 00:07:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:42,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:07:42,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:07:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:07:42,735 INFO L87 Difference]: Start difference. First operand 4653 states and 9532 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-02-09 00:07:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:46,501 INFO L93 Difference]: Finished difference Result 6590 states and 13516 transitions.
[2022-02-09 00:07:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:07:46,502 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-02-09 00:07:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:46,508 INFO L225 Difference]: With dead ends: 6590
[2022-02-09 00:07:46,508 INFO L226 Difference]: Without dead ends: 6590
[2022-02-09 00:07:46,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:07:46,509 INFO L933 BasicCegarLoop]: 551 mSDtfsCounter, 1731 mSDsluCounter, 9498 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 10049 SdHoareTripleChecker+Invalid, 3621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:46,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1731 Valid, 10049 Invalid, 3621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:07:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states.
[2022-02-09 00:07:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 4687.
[2022-02-09 00:07:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4684 states have (on average 2.049530315969257) internal successors, (9600), 4686 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 9600 transitions.
[2022-02-09 00:07:46,553 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 9600 transitions. Word has length 99
[2022-02-09 00:07:46,553 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:46,553 INFO L470 AbstractCegarLoop]: Abstraction has 4687 states and 9600 transitions.
[2022-02-09 00:07:46,554 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-02-09 00:07:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 9600 transitions.
[2022-02-09 00:07:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:46,557 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:46,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:07:46,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2022-02-09 00:07:46,557 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-02-09 00:07:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1855634331, now seen corresponding path program 7 times
[2022-02-09 00:07:46,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:46,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899699753]
[2022-02-09 00:07:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:46,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:47,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:47,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899699753]
[2022-02-09 00:07:47,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899699753] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:47,416 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:47,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:07:47,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557545757]
[2022-02-09 00:07:47,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:47,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:07:47,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:47,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:07:47,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:07:47,417 INFO L87 Difference]: Start difference. First operand 4687 states and 9600 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-02-09 00:07:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:52,672 INFO L93 Difference]: Finished difference Result 7348 states and 15076 transitions.
[2022-02-09 00:07:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:07:52,673 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-02-09 00:07:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:52,680 INFO L225 Difference]: With dead ends: 7348
[2022-02-09 00:07:52,681 INFO L226 Difference]: Without dead ends: 7348
[2022-02-09 00:07:52,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1132, Invalid=5674, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:07:52,681 INFO L933 BasicCegarLoop]: 559 mSDtfsCounter, 1812 mSDsluCounter, 10150 mSDsCounter, 0 mSdLazyCounter, 4152 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 10709 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:52,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1812 Valid, 10709 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4152 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:07:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7348 states.
[2022-02-09 00:07:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7348 to 5037.
[2022-02-09 00:07:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 5034 states have (on average 2.053237981724275) internal successors, (10336), 5036 states have internal predecessors, (10336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 10336 transitions.
[2022-02-09 00:07:52,731 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 10336 transitions. Word has length 99
[2022-02-09 00:07:52,731 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:52,731 INFO L470 AbstractCegarLoop]: Abstraction has 5037 states and 10336 transitions.
[2022-02-09 00:07:52,731 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-02-09 00:07:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 10336 transitions.
[2022-02-09 00:07:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:52,735 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:52,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:07:52,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2022-02-09 00:07:52,735 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-02-09 00:07:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1337266985, now seen corresponding path program 8 times
[2022-02-09 00:07:52,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:52,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245985457]
[2022-02-09 00:07:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:52,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:53,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:53,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245985457]
[2022-02-09 00:07:53,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245985457] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:53,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:53,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:07:53,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251311803]
[2022-02-09 00:07:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:53,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:07:53,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:53,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:07:53,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:07:53,550 INFO L87 Difference]: Start difference. First operand 5037 states and 10336 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-02-09 00:07:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:07:56,889 INFO L93 Difference]: Finished difference Result 8127 states and 16682 transitions.
[2022-02-09 00:07:56,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:07:56,889 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-02-09 00:07:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:07:56,897 INFO L225 Difference]: With dead ends: 8127
[2022-02-09 00:07:56,897 INFO L226 Difference]: Without dead ends: 8127
[2022-02-09 00:07:56,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:07:56,898 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1648 mSDsluCounter, 9852 mSDsCounter, 0 mSdLazyCounter, 3752 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 10407 SdHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:07:56,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1648 Valid, 10407 Invalid, 3787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:07:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8127 states.
[2022-02-09 00:07:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8127 to 4738.
[2022-02-09 00:07:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4738 states, 4735 states have (on average 2.048996832101373) internal successors, (9702), 4737 states have internal predecessors, (9702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:07:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 9702 transitions.
[2022-02-09 00:07:56,953 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 9702 transitions. Word has length 99
[2022-02-09 00:07:56,954 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:07:56,954 INFO L470 AbstractCegarLoop]: Abstraction has 4738 states and 9702 transitions.
[2022-02-09 00:07:56,954 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-02-09 00:07:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 9702 transitions.
[2022-02-09 00:07:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:07:56,957 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:07:56,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:07:56,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2022-02-09 00:07:56,958 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-02-09 00:07:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:07:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash 627083385, now seen corresponding path program 9 times
[2022-02-09 00:07:56,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:07:56,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614460105]
[2022-02-09 00:07:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:07:56,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:07:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:07:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:07:57,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:07:57,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614460105]
[2022-02-09 00:07:57,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614460105] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:07:57,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:07:57,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:07:57,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363125139]
[2022-02-09 00:07:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:07:57,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:07:57,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:07:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:07:57,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:07:57,789 INFO L87 Difference]: Start difference. First operand 4738 states and 9702 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-02-09 00:08:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:01,135 INFO L93 Difference]: Finished difference Result 6743 states and 13822 transitions.
[2022-02-09 00:08:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:08:01,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-02-09 00:08:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:01,143 INFO L225 Difference]: With dead ends: 6743
[2022-02-09 00:08:01,143 INFO L226 Difference]: Without dead ends: 6743
[2022-02-09 00:08:01,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:08:01,144 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1606 mSDsluCounter, 8943 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 9500 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:01,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1606 Valid, 9500 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:08:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states.
[2022-02-09 00:08:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 4755.
[2022-02-09 00:08:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4755 states, 4752 states have (on average 2.048821548821549) internal successors, (9736), 4754 states have internal predecessors, (9736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 9736 transitions.
[2022-02-09 00:08:01,195 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 9736 transitions. Word has length 99
[2022-02-09 00:08:01,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:01,195 INFO L470 AbstractCegarLoop]: Abstraction has 4755 states and 9736 transitions.
[2022-02-09 00:08:01,196 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-02-09 00:08:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 9736 transitions.
[2022-02-09 00:08:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:01,199 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:01,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:01,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2022-02-09 00:08:01,199 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-02-09 00:08:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 201193627, now seen corresponding path program 10 times
[2022-02-09 00:08:01,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:01,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266907609]
[2022-02-09 00:08:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:01,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:02,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:02,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266907609]
[2022-02-09 00:08:02,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266907609] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:02,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:02,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:08:02,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209480541]
[2022-02-09 00:08:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:02,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:08:02,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:08:02,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:08:02,214 INFO L87 Difference]: Start difference. First operand 4755 states and 9736 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-02-09 00:08:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:05,945 INFO L93 Difference]: Finished difference Result 7450 states and 15280 transitions.
[2022-02-09 00:08:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:08:05,945 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-02-09 00:08:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:05,954 INFO L225 Difference]: With dead ends: 7450
[2022-02-09 00:08:05,954 INFO L226 Difference]: Without dead ends: 7450
[2022-02-09 00:08:05,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:08:05,955 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1881 mSDsluCounter, 8799 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 9361 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:05,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1881 Valid, 9361 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3503 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:08:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states.
[2022-02-09 00:08:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 5139.
[2022-02-09 00:08:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 5136 states have (on average 2.0521806853582554) internal successors, (10540), 5138 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-02-09 00:08:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 10540 transitions.
[2022-02-09 00:08:06,017 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 10540 transitions. Word has length 99
[2022-02-09 00:08:06,017 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:06,017 INFO L470 AbstractCegarLoop]: Abstraction has 5139 states and 10540 transitions.
[2022-02-09 00:08:06,018 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-02-09 00:08:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 10540 transitions.
[2022-02-09 00:08:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:06,022 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:06,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:06,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2022-02-09 00:08:06,022 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-02-09 00:08:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1303259607, now seen corresponding path program 11 times
[2022-02-09 00:08:06,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:06,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698784102]
[2022-02-09 00:08:06,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:06,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:06,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:06,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698784102]
[2022-02-09 00:08:06,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698784102] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:06,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:06,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:08:06,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423637381]
[2022-02-09 00:08:06,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:06,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:08:06,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:08:06,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:08:06,861 INFO L87 Difference]: Start difference. First operand 5139 states and 10540 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-02-09 00:08:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:10,174 INFO L93 Difference]: Finished difference Result 8229 states and 16886 transitions.
[2022-02-09 00:08:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:08:10,174 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-02-09 00:08:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:10,184 INFO L225 Difference]: With dead ends: 8229
[2022-02-09 00:08:10,184 INFO L226 Difference]: Without dead ends: 8229
[2022-02-09 00:08:10,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:08:10,184 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1591 mSDsluCounter, 9272 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 9830 SdHoareTripleChecker+Invalid, 3489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:10,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1591 Valid, 9830 Invalid, 3489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:08:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states.
[2022-02-09 00:08:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 4772.
[2022-02-09 00:08:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4772 states, 4769 states have (on average 2.0486475152023487) internal successors, (9770), 4771 states have internal predecessors, (9770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 9770 transitions.
[2022-02-09 00:08:10,239 INFO L78 Accepts]: Start accepts. Automaton has 4772 states and 9770 transitions. Word has length 99
[2022-02-09 00:08:10,240 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:10,240 INFO L470 AbstractCegarLoop]: Abstraction has 4772 states and 9770 transitions.
[2022-02-09 00:08:10,240 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-02-09 00:08:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 9770 transitions.
[2022-02-09 00:08:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:10,243 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:10,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:10,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2022-02-09 00:08:10,243 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-02-09 00:08:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -234690567, now seen corresponding path program 12 times
[2022-02-09 00:08:10,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:10,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066850661]
[2022-02-09 00:08:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:10,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:10,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:10,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066850661]
[2022-02-09 00:08:10,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066850661] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:10,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:10,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:08:10,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757513386]
[2022-02-09 00:08:10,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:10,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:08:10,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:08:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:08:10,943 INFO L87 Difference]: Start difference. First operand 4772 states and 9770 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-02-09 00:08:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:14,871 INFO L93 Difference]: Finished difference Result 7518 states and 15416 transitions.
[2022-02-09 00:08:14,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:08:14,872 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-02-09 00:08:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:14,880 INFO L225 Difference]: With dead ends: 7518
[2022-02-09 00:08:14,880 INFO L226 Difference]: Without dead ends: 7518
[2022-02-09 00:08:14,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:08:14,881 INFO L933 BasicCegarLoop]: 564 mSDtfsCounter, 1855 mSDsluCounter, 10952 mSDsCounter, 0 mSdLazyCounter, 4341 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 11516 SdHoareTripleChecker+Invalid, 4386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:14,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 11516 Invalid, 4386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4341 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:08:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states.
[2022-02-09 00:08:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 5207.
[2022-02-09 00:08:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5207 states, 5204 states have (on average 2.051498847040738) internal successors, (10676), 5206 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-02-09 00:08:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5207 states to 5207 states and 10676 transitions.
[2022-02-09 00:08:14,942 INFO L78 Accepts]: Start accepts. Automaton has 5207 states and 10676 transitions. Word has length 99
[2022-02-09 00:08:14,943 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:14,943 INFO L470 AbstractCegarLoop]: Abstraction has 5207 states and 10676 transitions.
[2022-02-09 00:08:14,943 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-02-09 00:08:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5207 states and 10676 transitions.
[2022-02-09 00:08:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:14,947 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:14,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:14,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2022-02-09 00:08:14,947 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-02-09 00:08:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 867375413, now seen corresponding path program 13 times
[2022-02-09 00:08:14,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:14,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783669418]
[2022-02-09 00:08:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:14,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:15,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:15,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783669418]
[2022-02-09 00:08:15,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783669418] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:15,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:15,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:08:15,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677408880]
[2022-02-09 00:08:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:15,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:08:15,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:08:15,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:08:15,937 INFO L87 Difference]: Start difference. First operand 5207 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-02-09 00:08:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:21,393 INFO L93 Difference]: Finished difference Result 9846 states and 20243 transitions.
[2022-02-09 00:08:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:08:21,395 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-02-09 00:08:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:21,405 INFO L225 Difference]: With dead ends: 9846
[2022-02-09 00:08:21,405 INFO L226 Difference]: Without dead ends: 9846
[2022-02-09 00:08:21,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1411, Invalid=7145, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:08:21,406 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 2129 mSDsluCounter, 11115 mSDsCounter, 0 mSdLazyCounter, 4472 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 11683 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 4472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:21,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2129 Valid, 11683 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 4472 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:08:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states.
[2022-02-09 00:08:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 5245.
[2022-02-09 00:08:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5245 states, 5242 states have (on average 2.0507439908431895) internal successors, (10750), 5244 states have internal predecessors, (10750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 10750 transitions.
[2022-02-09 00:08:21,472 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 10750 transitions. Word has length 99
[2022-02-09 00:08:21,472 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:21,472 INFO L470 AbstractCegarLoop]: Abstraction has 5245 states and 10750 transitions.
[2022-02-09 00:08:21,472 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-02-09 00:08:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 10750 transitions.
[2022-02-09 00:08:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:21,476 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:21,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:21,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2022-02-09 00:08:21,476 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-02-09 00:08:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -625515723, now seen corresponding path program 14 times
[2022-02-09 00:08:21,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:21,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942673318]
[2022-02-09 00:08:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:21,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:22,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:22,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942673318]
[2022-02-09 00:08:22,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942673318] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:22,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:22,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:08:22,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039001898]
[2022-02-09 00:08:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:22,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:08:22,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:08:22,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:08:22,305 INFO L87 Difference]: Start difference. First operand 5245 states and 10750 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-02-09 00:08:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:27,094 INFO L93 Difference]: Finished difference Result 9883 states and 20302 transitions.
[2022-02-09 00:08:27,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:08:27,094 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-02-09 00:08:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:27,105 INFO L225 Difference]: With dead ends: 9883
[2022-02-09 00:08:27,105 INFO L226 Difference]: Without dead ends: 9883
[2022-02-09 00:08:27,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1408, Invalid=7148, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:08:27,106 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 1901 mSDsluCounter, 12857 mSDsCounter, 0 mSdLazyCounter, 4910 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 13579 SdHoareTripleChecker+Invalid, 4969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:27,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1901 Valid, 13579 Invalid, 4969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4910 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:08:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states.
[2022-02-09 00:08:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 5095.
[2022-02-09 00:08:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5092 states have (on average 2.0489002356637864) internal successors, (10433), 5094 states have internal predecessors, (10433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 10433 transitions.
[2022-02-09 00:08:27,182 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 10433 transitions. Word has length 99
[2022-02-09 00:08:27,182 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:27,182 INFO L470 AbstractCegarLoop]: Abstraction has 5095 states and 10433 transitions.
[2022-02-09 00:08:27,182 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-02-09 00:08:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 10433 transitions.
[2022-02-09 00:08:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:27,186 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:27,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:27,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2022-02-09 00:08:27,187 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-02-09 00:08:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash 658198483, now seen corresponding path program 15 times
[2022-02-09 00:08:27,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:27,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722516799]
[2022-02-09 00:08:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:27,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:27,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:27,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722516799]
[2022-02-09 00:08:27,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722516799] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:27,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:27,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:08:27,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431631711]
[2022-02-09 00:08:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:27,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:08:27,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:08:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:08:27,915 INFO L87 Difference]: Start difference. First operand 5095 states and 10433 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-02-09 00:08:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:31,965 INFO L93 Difference]: Finished difference Result 8286 states and 16996 transitions.
[2022-02-09 00:08:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:08:31,965 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-02-09 00:08:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:31,976 INFO L225 Difference]: With dead ends: 8286
[2022-02-09 00:08:31,977 INFO L226 Difference]: Without dead ends: 8286
[2022-02-09 00:08:31,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:08:31,978 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1806 mSDsluCounter, 8346 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 8906 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:31,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1806 Valid, 8906 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:08:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states.
[2022-02-09 00:08:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 4823.
[2022-02-09 00:08:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 4820 states have (on average 2.0481327800829874) internal successors, (9872), 4822 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 9872 transitions.
[2022-02-09 00:08:32,063 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 9872 transitions. Word has length 99
[2022-02-09 00:08:32,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:32,063 INFO L470 AbstractCegarLoop]: Abstraction has 4823 states and 9872 transitions.
[2022-02-09 00:08:32,063 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-02-09 00:08:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 9872 transitions.
[2022-02-09 00:08:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:32,066 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:32,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:32,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2022-02-09 00:08:32,067 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-02-09 00:08:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1242529499, now seen corresponding path program 16 times
[2022-02-09 00:08:32,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:32,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861255122]
[2022-02-09 00:08:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:32,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:32,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:32,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861255122]
[2022-02-09 00:08:32,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861255122] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:32,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:32,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:08:32,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987070204]
[2022-02-09 00:08:32,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:32,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:08:32,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:32,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:08:32,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:08:32,873 INFO L87 Difference]: Start difference. First operand 4823 states and 9872 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-02-09 00:08:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:37,761 INFO L93 Difference]: Finished difference Result 6556 states and 13431 transitions.
[2022-02-09 00:08:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:08:37,761 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-02-09 00:08:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:37,767 INFO L225 Difference]: With dead ends: 6556
[2022-02-09 00:08:37,767 INFO L226 Difference]: Without dead ends: 6556
[2022-02-09 00:08:37,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=946, Invalid=4604, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:08:37,768 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 1517 mSDsluCounter, 10460 mSDsCounter, 0 mSdLazyCounter, 3924 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 11025 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:37,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1517 Valid, 11025 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3924 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-09 00:08:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6556 states.
[2022-02-09 00:08:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6556 to 4823.
[2022-02-09 00:08:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 4820 states have (on average 2.0481327800829874) internal successors, (9872), 4822 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 9872 transitions.
[2022-02-09 00:08:37,811 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 9872 transitions. Word has length 99
[2022-02-09 00:08:37,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:37,811 INFO L470 AbstractCegarLoop]: Abstraction has 4823 states and 9872 transitions.
[2022-02-09 00:08:37,812 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-02-09 00:08:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 9872 transitions.
[2022-02-09 00:08:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:37,815 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:37,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, 1, 1, 1]
[2022-02-09 00:08:37,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2022-02-09 00:08:37,815 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-02-09 00:08:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1850403261, now seen corresponding path program 17 times
[2022-02-09 00:08:37,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:37,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138745937]
[2022-02-09 00:08:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:37,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:38,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:38,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138745937]
[2022-02-09 00:08:38,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138745937] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:38,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:38,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:08:38,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887501070]
[2022-02-09 00:08:38,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:38,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:08:38,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:38,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:08:38,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:08:38,489 INFO L87 Difference]: Start difference. First operand 4823 states and 9872 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-02-09 00:08:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:41,611 INFO L93 Difference]: Finished difference Result 6872 states and 14102 transitions.
[2022-02-09 00:08:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:08:41,612 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-02-09 00:08:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:41,618 INFO L225 Difference]: With dead ends: 6872
[2022-02-09 00:08:41,619 INFO L226 Difference]: Without dead ends: 6872
[2022-02-09 00:08:41,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:08:41,619 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1580 mSDsluCounter, 8894 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 9452 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:41,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 9452 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:08:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6872 states.
[2022-02-09 00:08:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6872 to 4858.
[2022-02-09 00:08:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4858 states, 4855 states have (on average 2.048403707518023) internal successors, (9945), 4857 states have internal predecessors, (9945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 9945 transitions.
[2022-02-09 00:08:41,669 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 9945 transitions. Word has length 99
[2022-02-09 00:08:41,669 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:41,669 INFO L470 AbstractCegarLoop]: Abstraction has 4858 states and 9945 transitions.
[2022-02-09 00:08:41,669 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-02-09 00:08:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 9945 transitions.
[2022-02-09 00:08:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:41,672 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:41,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:41,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2022-02-09 00:08:41,673 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-02-09 00:08:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1757759749, now seen corresponding path program 18 times
[2022-02-09 00:08:41,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:41,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060009391]
[2022-02-09 00:08:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:41,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:42,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-02-09 00:08:42,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:42,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060009391]
[2022-02-09 00:08:42,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060009391] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:42,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:42,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:08:42,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410139852]
[2022-02-09 00:08:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:42,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:08:42,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:08:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:08:42,309 INFO L87 Difference]: Start difference. First operand 4858 states and 9945 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-02-09 00:08:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:46,244 INFO L93 Difference]: Finished difference Result 8931 states and 18348 transitions.
[2022-02-09 00:08:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:08:46,244 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-02-09 00:08:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:46,268 INFO L225 Difference]: With dead ends: 8931
[2022-02-09 00:08:46,269 INFO L226 Difference]: Without dead ends: 8931
[2022-02-09 00:08:46,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:08:46,283 INFO L933 BasicCegarLoop]: 604 mSDtfsCounter, 1665 mSDsluCounter, 10703 mSDsCounter, 0 mSdLazyCounter, 3953 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 11307 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:46,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1665 Valid, 11307 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3953 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:08:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8931 states.
[2022-02-09 00:08:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8931 to 4860.
[2022-02-09 00:08:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4860 states, 4857 states have (on average 2.0483837759934116) internal successors, (9949), 4859 states have internal predecessors, (9949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 9949 transitions.
[2022-02-09 00:08:46,355 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 9949 transitions. Word has length 99
[2022-02-09 00:08:46,355 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:46,356 INFO L470 AbstractCegarLoop]: Abstraction has 4860 states and 9949 transitions.
[2022-02-09 00:08:46,356 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-02-09 00:08:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 9949 transitions.
[2022-02-09 00:08:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:46,359 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:46,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:46,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2022-02-09 00:08:46,359 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-02-09 00:08:46,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1330038123, now seen corresponding path program 19 times
[2022-02-09 00:08:46,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:46,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869922459]
[2022-02-09 00:08:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:46,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:47,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:47,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869922459]
[2022-02-09 00:08:47,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869922459] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:47,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:47,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:08:47,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761365128]
[2022-02-09 00:08:47,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:47,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:08:47,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:47,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:08:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:08:47,144 INFO L87 Difference]: Start difference. First operand 4860 states and 9949 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-02-09 00:08:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:51,945 INFO L93 Difference]: Finished difference Result 6973 states and 14306 transitions.
[2022-02-09 00:08:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:08:51,946 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-02-09 00:08:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:51,953 INFO L225 Difference]: With dead ends: 6973
[2022-02-09 00:08:51,953 INFO L226 Difference]: Without dead ends: 6973
[2022-02-09 00:08:51,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=940, Invalid=4610, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:08:51,954 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 1557 mSDsluCounter, 9787 mSDsCounter, 0 mSdLazyCounter, 3736 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 10359 SdHoareTripleChecker+Invalid, 3770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:51,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1557 Valid, 10359 Invalid, 3770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3736 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:08:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states.
[2022-02-09 00:08:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 4842.
[2022-02-09 00:08:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4842 states, 4839 states have (on average 2.048150444306675) internal successors, (9911), 4841 states have internal predecessors, (9911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4842 states to 4842 states and 9911 transitions.
[2022-02-09 00:08:52,008 INFO L78 Accepts]: Start accepts. Automaton has 4842 states and 9911 transitions. Word has length 99
[2022-02-09 00:08:52,008 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:52,008 INFO L470 AbstractCegarLoop]: Abstraction has 4842 states and 9911 transitions.
[2022-02-09 00:08:52,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-02-09 00:08:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4842 states and 9911 transitions.
[2022-02-09 00:08:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:52,011 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:52,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-02-09 00:08:52,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2022-02-09 00:08:52,012 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-02-09 00:08:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 969706245, now seen corresponding path program 20 times
[2022-02-09 00:08:52,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:52,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463474435]
[2022-02-09 00:08:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:52,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:53,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:53,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463474435]
[2022-02-09 00:08:53,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463474435] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:53,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:53,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:08:53,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890366309]
[2022-02-09 00:08:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:53,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:08:53,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:08:53,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:08:53,186 INFO L87 Difference]: Start difference. First operand 4842 states and 9911 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-02-09 00:08:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:08:58,970 INFO L93 Difference]: Finished difference Result 7878 states and 16150 transitions.
[2022-02-09 00:08:58,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:08:58,970 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-02-09 00:08:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:08:58,979 INFO L225 Difference]: With dead ends: 7878
[2022-02-09 00:08:58,979 INFO L226 Difference]: Without dead ends: 7878
[2022-02-09 00:08:58,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1181, Invalid=5461, Unknown=0, NotChecked=0, Total=6642
[2022-02-09 00:08:58,980 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 1751 mSDsluCounter, 11520 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 12117 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:08:58,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1751 Valid, 12117 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-09 00:08:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states.
[2022-02-09 00:08:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4872.
[2022-02-09 00:08:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:08:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:08:59,038 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:08:59,038 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:08:59,038 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:08:59,038 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-02-09 00:08:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:08:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:08:59,042 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:08:59,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:08:59,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2022-02-09 00:08:59,042 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-02-09 00:08:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:08:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 948513173, now seen corresponding path program 21 times
[2022-02-09 00:08:59,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:08:59,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077481605]
[2022-02-09 00:08:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:08:59,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:08:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:08:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:08:59,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:08:59,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077481605]
[2022-02-09 00:08:59,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077481605] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:08:59,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:08:59,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:08:59,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820689656]
[2022-02-09 00:08:59,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:08:59,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:08:59,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:08:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:08:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:08:59,878 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:09:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:05,101 INFO L93 Difference]: Finished difference Result 7785 states and 15957 transitions.
[2022-02-09 00:09:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:09:05,102 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-02-09 00:09:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:05,113 INFO L225 Difference]: With dead ends: 7785
[2022-02-09 00:09:05,113 INFO L226 Difference]: Without dead ends: 7785
[2022-02-09 00:09:05,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1060, Invalid=5102, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:09:05,114 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1929 mSDsluCounter, 10135 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 10714 SdHoareTripleChecker+Invalid, 3800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:05,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1929 Valid, 10714 Invalid, 3800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:09:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7785 states.
[2022-02-09 00:09:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7785 to 4874.
[2022-02-09 00:09:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions.
[2022-02-09 00:09:05,180 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99
[2022-02-09 00:09:05,180 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:05,180 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions.
[2022-02-09 00:09:05,180 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-02-09 00:09:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions.
[2022-02-09 00:09:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:05,184 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:05,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:05,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2022-02-09 00:09:05,185 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-02-09 00:09:05,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash -885464299, now seen corresponding path program 22 times
[2022-02-09 00:09:05,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:05,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899849532]
[2022-02-09 00:09:05,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:05,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:06,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:06,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899849532]
[2022-02-09 00:09:06,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899849532] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:06,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:06,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:09:06,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473480471]
[2022-02-09 00:09:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:06,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:09:06,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:06,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:09:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:09:06,071 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 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-02-09 00:09:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:11,083 INFO L93 Difference]: Finished difference Result 6740 states and 13803 transitions.
[2022-02-09 00:09:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:09:11,083 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-02-09 00:09:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:11,091 INFO L225 Difference]: With dead ends: 6740
[2022-02-09 00:09:11,091 INFO L226 Difference]: Without dead ends: 6740
[2022-02-09 00:09:11,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=951, Invalid=4749, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:09:11,093 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1521 mSDsluCounter, 10686 mSDsCounter, 0 mSdLazyCounter, 3957 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 11241 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:11,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 11241 Invalid, 3997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3957 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:09:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states.
[2022-02-09 00:09:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 4872.
[2022-02-09 00:09:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:09:11,172 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:09:11,172 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:11,172 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:09:11,172 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-02-09 00:09:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:09:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:11,176 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:11,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:11,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2022-02-09 00:09:11,176 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-02-09 00:09:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash -917579705, now seen corresponding path program 23 times
[2022-02-09 00:09:11,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:11,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672200682]
[2022-02-09 00:09:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:11,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:12,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:12,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672200682]
[2022-02-09 00:09:12,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672200682] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:12,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:12,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:09:12,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288542431]
[2022-02-09 00:09:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:12,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:09:12,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:09:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1236, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:09:12,279 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:09:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:18,744 INFO L93 Difference]: Finished difference Result 8263 states and 17009 transitions.
[2022-02-09 00:09:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:09:18,744 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-02-09 00:09:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:18,754 INFO L225 Difference]: With dead ends: 8263
[2022-02-09 00:09:18,754 INFO L226 Difference]: Without dead ends: 8263
[2022-02-09 00:09:18,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1407, Invalid=7149, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:09:18,756 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 2188 mSDsluCounter, 9560 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 10127 SdHoareTripleChecker+Invalid, 3815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:18,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2188 Valid, 10127 Invalid, 3815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:09:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8263 states.
[2022-02-09 00:09:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8263 to 5183.
[2022-02-09 00:09:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 5180 states have (on average 2.0557915057915057) internal successors, (10649), 5182 states have internal predecessors, (10649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 10649 transitions.
[2022-02-09 00:09:18,815 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 10649 transitions. Word has length 99
[2022-02-09 00:09:18,815 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:18,816 INFO L470 AbstractCegarLoop]: Abstraction has 5183 states and 10649 transitions.
[2022-02-09 00:09:18,816 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-02-09 00:09:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 10649 transitions.
[2022-02-09 00:09:18,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:18,819 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:18,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:18,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2022-02-09 00:09:18,820 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-02-09 00:09:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 184486275, now seen corresponding path program 24 times
[2022-02-09 00:09:18,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:18,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982478802]
[2022-02-09 00:09:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:18,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:19,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-02-09 00:09:19,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:19,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982478802]
[2022-02-09 00:09:19,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982478802] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:19,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:19,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:09:19,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322396533]
[2022-02-09 00:09:19,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:19,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:09:19,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:19,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:09:19,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:09:19,689 INFO L87 Difference]: Start difference. First operand 5183 states and 10649 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-02-09 00:09:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:24,059 INFO L93 Difference]: Finished difference Result 8696 states and 17879 transitions.
[2022-02-09 00:09:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:09:24,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-02-09 00:09:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:24,071 INFO L225 Difference]: With dead ends: 8696
[2022-02-09 00:09:24,071 INFO L226 Difference]: Without dead ends: 8696
[2022-02-09 00:09:24,072 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-02-09 00:09:24,072 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1715 mSDsluCounter, 9215 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 9778 SdHoareTripleChecker+Invalid, 3480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:24,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1715 Valid, 9778 Invalid, 3480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:09:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8696 states.
[2022-02-09 00:09:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8696 to 4890.
[2022-02-09 00:09:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4887 states have (on average 2.04829138530796) internal successors, (10010), 4889 states have internal predecessors, (10010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 10010 transitions.
[2022-02-09 00:09:24,160 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 10010 transitions. Word has length 99
[2022-02-09 00:09:24,161 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:24,161 INFO L470 AbstractCegarLoop]: Abstraction has 4890 states and 10010 transitions.
[2022-02-09 00:09:24,161 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-02-09 00:09:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 10010 transitions.
[2022-02-09 00:09:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:24,165 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:24,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-02-09 00:09:24,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2022-02-09 00:09:24,165 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-02-09 00:09:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:24,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1010223217, now seen corresponding path program 25 times
[2022-02-09 00:09:24,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:24,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090470462]
[2022-02-09 00:09:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:24,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:24,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:24,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090470462]
[2022-02-09 00:09:24,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090470462] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:24,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:24,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:09:24,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394002756]
[2022-02-09 00:09:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:24,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:09:24,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:09:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:09:24,848 INFO L87 Difference]: Start difference. First operand 4890 states and 10010 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-02-09 00:09:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:28,388 INFO L93 Difference]: Finished difference Result 9191 states and 18886 transitions.
[2022-02-09 00:09:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:09:28,388 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-02-09 00:09:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:28,401 INFO L225 Difference]: With dead ends: 9191
[2022-02-09 00:09:28,401 INFO L226 Difference]: Without dead ends: 9191
[2022-02-09 00:09:28,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:09:28,402 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 1602 mSDsluCounter, 10636 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 11245 SdHoareTripleChecker+Invalid, 3905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:28,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1602 Valid, 11245 Invalid, 3905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:09:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9191 states.
[2022-02-09 00:09:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9191 to 4892.
[2022-02-09 00:09:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4889 states have (on average 2.048271630190223) internal successors, (10014), 4891 states have internal predecessors, (10014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 10014 transitions.
[2022-02-09 00:09:28,483 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 10014 transitions. Word has length 99
[2022-02-09 00:09:28,497 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:28,497 INFO L470 AbstractCegarLoop]: Abstraction has 4892 states and 10014 transitions.
[2022-02-09 00:09:28,497 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-02-09 00:09:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 10014 transitions.
[2022-02-09 00:09:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:28,501 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:28,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:28,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2022-02-09 00:09:28,501 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-02-09 00:09:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:28,502 INFO L85 PathProgramCache]: Analyzing trace with hash 196946207, now seen corresponding path program 26 times
[2022-02-09 00:09:28,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:28,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377965840]
[2022-02-09 00:09:28,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:28,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:29,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:29,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377965840]
[2022-02-09 00:09:29,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377965840] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:29,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:29,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:09:29,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045933754]
[2022-02-09 00:09:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:29,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:09:29,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:29,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:09:29,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:09:29,454 INFO L87 Difference]: Start difference. First operand 4892 states and 10014 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-02-09 00:09:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:32,740 INFO L93 Difference]: Finished difference Result 7301 states and 14980 transitions.
[2022-02-09 00:09:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:09:32,740 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-02-09 00:09:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:32,749 INFO L225 Difference]: With dead ends: 7301
[2022-02-09 00:09:32,749 INFO L226 Difference]: Without dead ends: 7301
[2022-02-09 00:09:32,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:09:32,750 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1726 mSDsluCounter, 9527 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 10104 SdHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:32,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1726 Valid, 10104 Invalid, 3580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:09:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7301 states.
[2022-02-09 00:09:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7301 to 4874.
[2022-02-09 00:09:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions.
[2022-02-09 00:09:32,846 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99
[2022-02-09 00:09:32,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:32,846 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions.
[2022-02-09 00:09:32,847 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-02-09 00:09:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions.
[2022-02-09 00:09:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:32,850 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:32,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:32,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2022-02-09 00:09:32,850 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-02-09 00:09:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1806797157, now seen corresponding path program 27 times
[2022-02-09 00:09:32,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:32,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925067186]
[2022-02-09 00:09:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:32,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:34,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:34,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925067186]
[2022-02-09 00:09:34,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925067186] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:34,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:34,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:09:34,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654934801]
[2022-02-09 00:09:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:34,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:09:34,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:34,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:09:34,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:09:34,125 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 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-02-09 00:09:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:39,376 INFO L93 Difference]: Finished difference Result 7661 states and 15725 transitions.
[2022-02-09 00:09:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:09:39,380 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-02-09 00:09:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:39,388 INFO L225 Difference]: With dead ends: 7661
[2022-02-09 00:09:39,388 INFO L226 Difference]: Without dead ends: 7661
[2022-02-09 00:09:39,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1130, Invalid=5676, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:09:39,389 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 1826 mSDsluCounter, 10712 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 11277 SdHoareTripleChecker+Invalid, 4506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:39,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1826 Valid, 11277 Invalid, 4506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:09:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7661 states.
[2022-02-09 00:09:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7661 to 5139.
[2022-02-09 00:09:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 5136 states have (on average 2.052570093457944) internal successors, (10542), 5138 states have internal predecessors, (10542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 10542 transitions.
[2022-02-09 00:09:39,460 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 10542 transitions. Word has length 99
[2022-02-09 00:09:39,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:39,460 INFO L470 AbstractCegarLoop]: Abstraction has 5139 states and 10542 transitions.
[2022-02-09 00:09:39,460 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-02-09 00:09:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 10542 transitions.
[2022-02-09 00:09:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:39,464 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:39,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:39,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2022-02-09 00:09:39,464 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-02-09 00:09:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1386104159, now seen corresponding path program 28 times
[2022-02-09 00:09:39,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:39,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817062332]
[2022-02-09 00:09:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:39,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:40,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:40,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817062332]
[2022-02-09 00:09:40,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817062332] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:40,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:40,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:09:40,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237621770]
[2022-02-09 00:09:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:40,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:09:40,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:09:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:09:40,029 INFO L87 Difference]: Start difference. First operand 5139 states and 10542 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-02-09 00:09:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:43,241 INFO L93 Difference]: Finished difference Result 8440 states and 17331 transitions.
[2022-02-09 00:09:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:09:43,241 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-02-09 00:09:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:43,250 INFO L225 Difference]: With dead ends: 8440
[2022-02-09 00:09:43,250 INFO L226 Difference]: Without dead ends: 8440
[2022-02-09 00:09:43,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:09:43,251 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 1581 mSDsluCounter, 9204 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 9765 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:43,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1581 Valid, 9765 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3517 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:09:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states.
[2022-02-09 00:09:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 4872.
[2022-02-09 00:09:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:09:43,305 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:09:43,305 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:43,305 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:09:43,305 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-02-09 00:09:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:09:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:43,308 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:43,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:43,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2022-02-09 00:09:43,308 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-02-09 00:09:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:43,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1671774703, now seen corresponding path program 29 times
[2022-02-09 00:09:43,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:43,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948997494]
[2022-02-09 00:09:43,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:43,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:44,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:44,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948997494]
[2022-02-09 00:09:44,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948997494] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:44,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:44,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:09:44,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275040056]
[2022-02-09 00:09:44,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:44,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:09:44,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:09:44,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:09:44,191 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:09:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:48,496 INFO L93 Difference]: Finished difference Result 7957 states and 16353 transitions.
[2022-02-09 00:09:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:09:48,497 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-02-09 00:09:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:48,505 INFO L225 Difference]: With dead ends: 7957
[2022-02-09 00:09:48,505 INFO L226 Difference]: Without dead ends: 7957
[2022-02-09 00:09:48,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1134, Invalid=5672, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:09:48,505 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1852 mSDsluCounter, 10718 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 11285 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:48,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1852 Valid, 11285 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:09:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states.
[2022-02-09 00:09:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 5187.
[2022-02-09 00:09:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 5184 states have (on average 2.0557484567901234) internal successors, (10657), 5186 states have internal predecessors, (10657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 10657 transitions.
[2022-02-09 00:09:48,556 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 10657 transitions. Word has length 99
[2022-02-09 00:09:48,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:48,556 INFO L470 AbstractCegarLoop]: Abstraction has 5187 states and 10657 transitions.
[2022-02-09 00:09:48,556 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-02-09 00:09:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 10657 transitions.
[2022-02-09 00:09:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:48,559 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:48,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:48,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2022-02-09 00:09:48,560 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-02-09 00:09:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash -569708723, now seen corresponding path program 30 times
[2022-02-09 00:09:48,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:48,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694304367]
[2022-02-09 00:09:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:48,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:49,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:49,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694304367]
[2022-02-09 00:09:49,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694304367] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:49,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:49,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:09:49,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986903383]
[2022-02-09 00:09:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:49,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:09:49,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:09:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:09:49,146 INFO L87 Difference]: Start difference. First operand 5187 states and 10657 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-02-09 00:09:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:52,491 INFO L93 Difference]: Finished difference Result 8753 states and 17993 transitions.
[2022-02-09 00:09:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:09:52,491 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-02-09 00:09:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:52,499 INFO L225 Difference]: With dead ends: 8753
[2022-02-09 00:09:52,499 INFO L226 Difference]: Without dead ends: 8753
[2022-02-09 00:09:52,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:09:52,500 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1548 mSDsluCounter, 10007 mSDsCounter, 0 mSdLazyCounter, 3909 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10570 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:52,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 10570 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3909 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:09:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states.
[2022-02-09 00:09:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 4894.
[2022-02-09 00:09:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 4891 states have (on average 2.0482518912287877) internal successors, (10018), 4893 states have internal predecessors, (10018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 10018 transitions.
[2022-02-09 00:09:52,555 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 10018 transitions. Word has length 99
[2022-02-09 00:09:52,555 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:52,555 INFO L470 AbstractCegarLoop]: Abstraction has 4894 states and 10018 transitions.
[2022-02-09 00:09:52,555 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-02-09 00:09:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 10018 transitions.
[2022-02-09 00:09:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:52,559 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:52,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:52,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2022-02-09 00:09:52,559 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-02-09 00:09:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1764418215, now seen corresponding path program 31 times
[2022-02-09 00:09:52,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:52,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254581089]
[2022-02-09 00:09:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:52,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:53,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:53,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254581089]
[2022-02-09 00:09:53,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254581089] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:53,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:53,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:09:53,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071674228]
[2022-02-09 00:09:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:53,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:09:53,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:53,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:09:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:09:53,139 INFO L87 Difference]: Start difference. First operand 4894 states and 10018 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-02-09 00:09:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:09:56,574 INFO L93 Difference]: Finished difference Result 9248 states and 19000 transitions.
[2022-02-09 00:09:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:09:56,574 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-02-09 00:09:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:09:56,584 INFO L225 Difference]: With dead ends: 9248
[2022-02-09 00:09:56,584 INFO L226 Difference]: Without dead ends: 9248
[2022-02-09 00:09:56,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:09:56,585 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 1675 mSDsluCounter, 10211 mSDsCounter, 0 mSdLazyCounter, 3787 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 10820 SdHoareTripleChecker+Invalid, 3821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:09:56,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1675 Valid, 10820 Invalid, 3821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3787 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:09:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9248 states.
[2022-02-09 00:09:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9248 to 4896.
[2022-02-09 00:09:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4893 states have (on average 2.048232168403842) internal successors, (10022), 4895 states have internal predecessors, (10022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:09:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10022 transitions.
[2022-02-09 00:09:56,641 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10022 transitions. Word has length 99
[2022-02-09 00:09:56,641 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:09:56,641 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 10022 transitions.
[2022-02-09 00:09:56,641 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-02-09 00:09:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10022 transitions.
[2022-02-09 00:09:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:09:56,645 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:09:56,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:09:56,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2022-02-09 00:09:56,645 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-02-09 00:09:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:09:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -557248791, now seen corresponding path program 32 times
[2022-02-09 00:09:56,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:09:56,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540186580]
[2022-02-09 00:09:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:09:56,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:09:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:09:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:09:57,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:09:57,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540186580]
[2022-02-09 00:09:57,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540186580] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:09:57,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:09:57,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:09:57,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028015]
[2022-02-09 00:09:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:09:57,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:09:57,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:09:57,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:09:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:09:57,286 INFO L87 Difference]: Start difference. First operand 4896 states and 10022 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-02-09 00:10:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:00,514 INFO L93 Difference]: Finished difference Result 7358 states and 15094 transitions.
[2022-02-09 00:10:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:00,515 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-02-09 00:10:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:00,522 INFO L225 Difference]: With dead ends: 7358
[2022-02-09 00:10:00,522 INFO L226 Difference]: Without dead ends: 7358
[2022-02-09 00:10:00,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:10:00,523 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1715 mSDsluCounter, 8754 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 9331 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:00,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1715 Valid, 9331 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:10:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7358 states.
[2022-02-09 00:10:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7358 to 4878.
[2022-02-09 00:10:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4875 states have (on average 2.048) internal successors, (9984), 4877 states have internal predecessors, (9984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 9984 transitions.
[2022-02-09 00:10:00,571 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 9984 transitions. Word has length 99
[2022-02-09 00:10:00,571 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:00,571 INFO L470 AbstractCegarLoop]: Abstraction has 4878 states and 9984 transitions.
[2022-02-09 00:10:00,571 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-02-09 00:10:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 9984 transitions.
[2022-02-09 00:10:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:00,574 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:00,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:00,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2022-02-09 00:10:00,575 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-02-09 00:10:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1052602159, now seen corresponding path program 33 times
[2022-02-09 00:10:00,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:00,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806931718]
[2022-02-09 00:10:00,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:00,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:01,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:01,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806931718]
[2022-02-09 00:10:01,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806931718] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:01,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:01,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:01,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788877032]
[2022-02-09 00:10:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:01,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:01,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:01,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:01,392 INFO L87 Difference]: Start difference. First operand 4878 states and 9984 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-02-09 00:10:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:05,350 INFO L93 Difference]: Finished difference Result 7386 states and 15167 transitions.
[2022-02-09 00:10:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:05,350 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-02-09 00:10:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:05,358 INFO L225 Difference]: With dead ends: 7386
[2022-02-09 00:10:05,358 INFO L226 Difference]: Without dead ends: 7386
[2022-02-09 00:10:05,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:05,359 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1648 mSDsluCounter, 9926 mSDsCounter, 0 mSdLazyCounter, 3815 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 10493 SdHoareTripleChecker+Invalid, 3851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:05,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1648 Valid, 10493 Invalid, 3851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3815 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:10:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states.
[2022-02-09 00:10:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 4876.
[2022-02-09 00:10:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4873 states have (on average 2.0480197003899034) internal successors, (9980), 4875 states have internal predecessors, (9980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 9980 transitions.
[2022-02-09 00:10:05,410 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 9980 transitions. Word has length 99
[2022-02-09 00:10:05,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:05,410 INFO L470 AbstractCegarLoop]: Abstraction has 4876 states and 9980 transitions.
[2022-02-09 00:10:05,410 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-02-09 00:10:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 9980 transitions.
[2022-02-09 00:10:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:05,413 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:05,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:05,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2022-02-09 00:10:05,414 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-02-09 00:10:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1129847727, now seen corresponding path program 34 times
[2022-02-09 00:10:05,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:05,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901141352]
[2022-02-09 00:10:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:05,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:06,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:06,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901141352]
[2022-02-09 00:10:06,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901141352] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:06,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:06,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:06,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155888225]
[2022-02-09 00:10:06,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:06,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:06,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:06,011 INFO L87 Difference]: Start difference. First operand 4876 states and 9980 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-02-09 00:10:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:09,310 INFO L93 Difference]: Finished difference Result 7043 states and 14445 transitions.
[2022-02-09 00:10:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:09,311 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-02-09 00:10:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:09,318 INFO L225 Difference]: With dead ends: 7043
[2022-02-09 00:10:09,318 INFO L226 Difference]: Without dead ends: 7043
[2022-02-09 00:10:09,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:09,319 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1739 mSDsluCounter, 8915 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 9475 SdHoareTripleChecker+Invalid, 3571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:09,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1739 Valid, 9475 Invalid, 3571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3532 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:10:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states.
[2022-02-09 00:10:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 4872.
[2022-02-09 00:10:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:10:09,367 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:10:09,367 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:09,368 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:10:09,368 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-02-09 00:10:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:10:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:09,371 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:09,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:09,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2022-02-09 00:10:09,371 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-02-09 00:10:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2006338119, now seen corresponding path program 35 times
[2022-02-09 00:10:09,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:09,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132509130]
[2022-02-09 00:10:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:09,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:10,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:10,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132509130]
[2022-02-09 00:10:10,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132509130] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:10,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:10,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:10,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515152573]
[2022-02-09 00:10:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:10,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:10,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:10,205 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:10:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:14,979 INFO L93 Difference]: Finished difference Result 7396 states and 15187 transitions.
[2022-02-09 00:10:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:14,980 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-02-09 00:10:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:14,987 INFO L225 Difference]: With dead ends: 7396
[2022-02-09 00:10:14,987 INFO L226 Difference]: Without dead ends: 7396
[2022-02-09 00:10:14,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:14,988 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 1805 mSDsluCounter, 8932 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 9500 SdHoareTripleChecker+Invalid, 3596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:14,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1805 Valid, 9500 Invalid, 3596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:10:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7396 states.
[2022-02-09 00:10:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7396 to 4900.
[2022-02-09 00:10:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4900 states, 4897 states have (on average 2.0481927710843375) internal successors, (10030), 4899 states have internal predecessors, (10030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 10030 transitions.
[2022-02-09 00:10:15,037 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 10030 transitions. Word has length 99
[2022-02-09 00:10:15,037 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:15,037 INFO L470 AbstractCegarLoop]: Abstraction has 4900 states and 10030 transitions.
[2022-02-09 00:10:15,038 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-02-09 00:10:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 10030 transitions.
[2022-02-09 00:10:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:15,041 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:15,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:15,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2022-02-09 00:10:15,041 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-02-09 00:10:15,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2098981631, now seen corresponding path program 36 times
[2022-02-09 00:10:15,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:15,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397518888]
[2022-02-09 00:10:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:15,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:15,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-02-09 00:10:15,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:15,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397518888]
[2022-02-09 00:10:15,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397518888] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:15,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:15,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:15,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345613517]
[2022-02-09 00:10:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:15,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:15,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:15,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:15,746 INFO L87 Difference]: Start difference. First operand 4900 states and 10030 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-02-09 00:10:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:20,020 INFO L93 Difference]: Finished difference Result 9343 states and 19190 transitions.
[2022-02-09 00:10:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:10:20,020 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-02-09 00:10:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:20,030 INFO L225 Difference]: With dead ends: 9343
[2022-02-09 00:10:20,030 INFO L226 Difference]: Without dead ends: 9343
[2022-02-09 00:10:20,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:10:20,031 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 1639 mSDsluCounter, 10325 mSDsCounter, 0 mSdLazyCounter, 3900 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 10939 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:20,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1639 Valid, 10939 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3900 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:10:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9343 states.
[2022-02-09 00:10:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9343 to 4902.
[2022-02-09 00:10:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4899 states have (on average 2.0481730965503164) internal successors, (10034), 4901 states have internal predecessors, (10034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 10034 transitions.
[2022-02-09 00:10:20,089 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 10034 transitions. Word has length 99
[2022-02-09 00:10:20,089 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:20,089 INFO L470 AbstractCegarLoop]: Abstraction has 4902 states and 10034 transitions.
[2022-02-09 00:10:20,089 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-02-09 00:10:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 10034 transitions.
[2022-02-09 00:10:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:20,093 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:20,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:20,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2022-02-09 00:10:20,093 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-02-09 00:10:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -891812207, now seen corresponding path program 37 times
[2022-02-09 00:10:20,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:20,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090879530]
[2022-02-09 00:10:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:20,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:20,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:20,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090879530]
[2022-02-09 00:10:20,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090879530] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:20,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:20,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:10:20,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483159057]
[2022-02-09 00:10:20,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:20,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:10:20,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:20,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:10:20,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:10:20,685 INFO L87 Difference]: Start difference. First operand 4902 states and 10034 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-02-09 00:10:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:24,006 INFO L93 Difference]: Finished difference Result 7453 states and 15284 transitions.
[2022-02-09 00:10:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:24,006 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-02-09 00:10:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:24,014 INFO L225 Difference]: With dead ends: 7453
[2022-02-09 00:10:24,014 INFO L226 Difference]: Without dead ends: 7453
[2022-02-09 00:10:24,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:10:24,015 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 1670 mSDsluCounter, 9797 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 10379 SdHoareTripleChecker+Invalid, 3802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:24,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 10379 Invalid, 3802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:10:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states.
[2022-02-09 00:10:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 4884.
[2022-02-09 00:10:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4884 states, 4881 states have (on average 2.047940995697603) internal successors, (9996), 4883 states have internal predecessors, (9996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 9996 transitions.
[2022-02-09 00:10:24,064 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 9996 transitions. Word has length 99
[2022-02-09 00:10:24,064 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:24,064 INFO L470 AbstractCegarLoop]: Abstraction has 4884 states and 9996 transitions.
[2022-02-09 00:10:24,064 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-02-09 00:10:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 9996 transitions.
[2022-02-09 00:10:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:24,067 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:24,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:24,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2022-02-09 00:10:24,068 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-02-09 00:10:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash 718038743, now seen corresponding path program 38 times
[2022-02-09 00:10:24,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:24,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031923562]
[2022-02-09 00:10:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:24,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:24,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:24,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031923562]
[2022-02-09 00:10:24,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031923562] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:24,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:24,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:24,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557131690]
[2022-02-09 00:10:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:24,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:24,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:24,882 INFO L87 Difference]: Start difference. First operand 4884 states and 9996 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-02-09 00:10:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:28,084 INFO L93 Difference]: Finished difference Result 7481 states and 15357 transitions.
[2022-02-09 00:10:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:28,084 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-02-09 00:10:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:28,091 INFO L225 Difference]: With dead ends: 7481
[2022-02-09 00:10:28,091 INFO L226 Difference]: Without dead ends: 7481
[2022-02-09 00:10:28,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:28,092 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 1596 mSDsluCounter, 9045 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 9617 SdHoareTripleChecker+Invalid, 3572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:28,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1596 Valid, 9617 Invalid, 3572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:10:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7481 states.
[2022-02-09 00:10:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7481 to 4882.
[2022-02-09 00:10:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4879 states have (on average 2.047960647673704) internal successors, (9992), 4881 states have internal predecessors, (9992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 9992 transitions.
[2022-02-09 00:10:28,143 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 9992 transitions. Word has length 99
[2022-02-09 00:10:28,143 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:28,143 INFO L470 AbstractCegarLoop]: Abstraction has 4882 states and 9992 transitions.
[2022-02-09 00:10:28,143 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-02-09 00:10:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 9992 transitions.
[2022-02-09 00:10:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:28,146 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:28,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:28,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2022-02-09 00:10:28,147 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-02-09 00:10:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1464411143, now seen corresponding path program 39 times
[2022-02-09 00:10:28,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:28,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457954505]
[2022-02-09 00:10:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:28,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:28,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:28,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457954505]
[2022-02-09 00:10:28,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457954505] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:28,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:28,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:10:28,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071444762]
[2022-02-09 00:10:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:28,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:10:28,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:10:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:10:28,987 INFO L87 Difference]: Start difference. First operand 4882 states and 9992 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-02-09 00:10:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:32,474 INFO L93 Difference]: Finished difference Result 7532 states and 15459 transitions.
[2022-02-09 00:10:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:32,474 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-02-09 00:10:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:32,483 INFO L225 Difference]: With dead ends: 7532
[2022-02-09 00:10:32,483 INFO L226 Difference]: Without dead ends: 7532
[2022-02-09 00:10:32,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:10:32,483 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1616 mSDsluCounter, 10036 mSDsCounter, 0 mSdLazyCounter, 3862 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 10607 SdHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:32,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1616 Valid, 10607 Invalid, 3901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3862 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:10:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7532 states.
[2022-02-09 00:10:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7532 to 4878.
[2022-02-09 00:10:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4875 states have (on average 2.048) internal successors, (9984), 4877 states have internal predecessors, (9984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 9984 transitions.
[2022-02-09 00:10:32,536 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 9984 transitions. Word has length 99
[2022-02-09 00:10:32,536 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:32,536 INFO L470 AbstractCegarLoop]: Abstraction has 4878 states and 9984 transitions.
[2022-02-09 00:10:32,536 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-02-09 00:10:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 9984 transitions.
[2022-02-09 00:10:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:32,539 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:32,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:32,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2022-02-09 00:10:32,540 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-02-09 00:10:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 259071161, now seen corresponding path program 40 times
[2022-02-09 00:10:32,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:32,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944457943]
[2022-02-09 00:10:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:32,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:33,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-02-09 00:10:33,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:33,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944457943]
[2022-02-09 00:10:33,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944457943] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:33,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:33,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:33,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368227463]
[2022-02-09 00:10:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:33,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:33,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:33,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:33,191 INFO L87 Difference]: Start difference. First operand 4878 states and 9984 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-02-09 00:10:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:36,558 INFO L93 Difference]: Finished difference Result 7134 states and 14627 transitions.
[2022-02-09 00:10:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:36,558 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-02-09 00:10:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:36,565 INFO L225 Difference]: With dead ends: 7134
[2022-02-09 00:10:36,565 INFO L226 Difference]: Without dead ends: 7134
[2022-02-09 00:10:36,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:36,566 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1531 mSDsluCounter, 8982 mSDsCounter, 0 mSdLazyCounter, 3520 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 9548 SdHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:36,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1531 Valid, 9548 Invalid, 3553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3520 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:10:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states.
[2022-02-09 00:10:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 4872.
[2022-02-09 00:10:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:10:36,615 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:10:36,615 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:36,615 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:10:36,615 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-02-09 00:10:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:10:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:36,618 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:36,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:36,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2022-02-09 00:10:36,618 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-02-09 00:10:36,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1251499575, now seen corresponding path program 41 times
[2022-02-09 00:10:36,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:36,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905348221]
[2022-02-09 00:10:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:36,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:37,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-02-09 00:10:37,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:37,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905348221]
[2022-02-09 00:10:37,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905348221] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:37,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:37,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:37,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492007031]
[2022-02-09 00:10:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:37,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:37,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:37,188 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:10:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:40,646 INFO L93 Difference]: Finished difference Result 7472 states and 15339 transitions.
[2022-02-09 00:10:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:40,646 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-02-09 00:10:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:40,654 INFO L225 Difference]: With dead ends: 7472
[2022-02-09 00:10:40,654 INFO L226 Difference]: Without dead ends: 7472
[2022-02-09 00:10:40,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:40,655 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1693 mSDsluCounter, 9833 mSDsCounter, 0 mSdLazyCounter, 3888 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 10404 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:40,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1693 Valid, 10404 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:10:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states.
[2022-02-09 00:10:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 4902.
[2022-02-09 00:10:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4899 states have (on average 2.0481730965503164) internal successors, (10034), 4901 states have internal predecessors, (10034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 10034 transitions.
[2022-02-09 00:10:40,704 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 10034 transitions. Word has length 99
[2022-02-09 00:10:40,704 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:40,704 INFO L470 AbstractCegarLoop]: Abstraction has 4902 states and 10034 transitions.
[2022-02-09 00:10:40,704 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-02-09 00:10:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 10034 transitions.
[2022-02-09 00:10:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:40,707 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:40,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:40,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2022-02-09 00:10:40,708 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-02-09 00:10:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1158856063, now seen corresponding path program 42 times
[2022-02-09 00:10:40,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:40,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813638464]
[2022-02-09 00:10:40,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:40,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:41,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:41,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813638464]
[2022-02-09 00:10:41,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813638464] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:41,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:41,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:10:41,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232082728]
[2022-02-09 00:10:41,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:41,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:10:41,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:41,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:10:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:10:41,495 INFO L87 Difference]: Start difference. First operand 4902 states and 10034 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-02-09 00:10:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:45,389 INFO L93 Difference]: Finished difference Result 9419 states and 19342 transitions.
[2022-02-09 00:10:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:10:45,390 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-02-09 00:10:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:45,400 INFO L225 Difference]: With dead ends: 9419
[2022-02-09 00:10:45,400 INFO L226 Difference]: Without dead ends: 9419
[2022-02-09 00:10:45,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:10:45,401 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 1966 mSDsluCounter, 9933 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 10550 SdHoareTripleChecker+Invalid, 3616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:45,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1966 Valid, 10550 Invalid, 3616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3570 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:10:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9419 states.
[2022-02-09 00:10:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9419 to 4904.
[2022-02-09 00:10:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4904 states, 4901 states have (on average 2.0481534380738626) internal successors, (10038), 4903 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 10038 transitions.
[2022-02-09 00:10:45,462 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 10038 transitions. Word has length 99
[2022-02-09 00:10:45,462 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:45,462 INFO L470 AbstractCegarLoop]: Abstraction has 4904 states and 10038 transitions.
[2022-02-09 00:10:45,462 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-02-09 00:10:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 10038 transitions.
[2022-02-09 00:10:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:45,465 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:45,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:45,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2022-02-09 00:10:45,466 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-02-09 00:10:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1928941809, now seen corresponding path program 43 times
[2022-02-09 00:10:45,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:45,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874604447]
[2022-02-09 00:10:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:45,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:46,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:46,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874604447]
[2022-02-09 00:10:46,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874604447] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:46,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:46,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:10:46,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350394272]
[2022-02-09 00:10:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:46,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:10:46,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:10:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:10:46,303 INFO L87 Difference]: Start difference. First operand 4904 states and 10038 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-02-09 00:10:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:50,244 INFO L93 Difference]: Finished difference Result 7529 states and 15436 transitions.
[2022-02-09 00:10:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:50,244 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-02-09 00:10:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:50,254 INFO L225 Difference]: With dead ends: 7529
[2022-02-09 00:10:50,254 INFO L226 Difference]: Without dead ends: 7529
[2022-02-09 00:10:50,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:10:50,255 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1697 mSDsluCounter, 9445 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 10030 SdHoareTripleChecker+Invalid, 3527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:50,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1697 Valid, 10030 Invalid, 3527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:10:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states.
[2022-02-09 00:10:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 4886.
[2022-02-09 00:10:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4886 states, 4883 states have (on average 2.047921359819783) internal successors, (10000), 4885 states have internal predecessors, (10000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 10000 transitions.
[2022-02-09 00:10:50,312 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 10000 transitions. Word has length 99
[2022-02-09 00:10:50,312 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:50,312 INFO L470 AbstractCegarLoop]: Abstraction has 4886 states and 10000 transitions.
[2022-02-09 00:10:50,312 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-02-09 00:10:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 10000 transitions.
[2022-02-09 00:10:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:50,316 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:50,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:50,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2022-02-09 00:10:50,316 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-02-09 00:10:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash -319090859, now seen corresponding path program 44 times
[2022-02-09 00:10:50,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:50,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680514937]
[2022-02-09 00:10:50,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:50,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:10:51,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:51,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680514937]
[2022-02-09 00:10:51,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680514937] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:51,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:51,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:51,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222365086]
[2022-02-09 00:10:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:51,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:51,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:51,102 INFO L87 Difference]: Start difference. First operand 4886 states and 10000 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-02-09 00:10:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:55,243 INFO L93 Difference]: Finished difference Result 7557 states and 15509 transitions.
[2022-02-09 00:10:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:55,243 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-02-09 00:10:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:55,252 INFO L225 Difference]: With dead ends: 7557
[2022-02-09 00:10:55,252 INFO L226 Difference]: Without dead ends: 7557
[2022-02-09 00:10:55,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:55,253 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 1699 mSDsluCounter, 9769 mSDsCounter, 0 mSdLazyCounter, 3810 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 10344 SdHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:55,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1699 Valid, 10344 Invalid, 3845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3810 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:10:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states.
[2022-02-09 00:10:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 4884.
[2022-02-09 00:10:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4884 states, 4881 states have (on average 2.047940995697603) internal successors, (9996), 4883 states have internal predecessors, (9996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 9996 transitions.
[2022-02-09 00:10:55,310 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 9996 transitions. Word has length 99
[2022-02-09 00:10:55,310 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:55,310 INFO L470 AbstractCegarLoop]: Abstraction has 4884 states and 9996 transitions.
[2022-02-09 00:10:55,311 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-02-09 00:10:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 9996 transitions.
[2022-02-09 00:10:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:55,314 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:55,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:55,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2022-02-09 00:10:55,314 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-02-09 00:10:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1793426551, now seen corresponding path program 45 times
[2022-02-09 00:10:55,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:55,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158095744]
[2022-02-09 00:10:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:55,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:10:56,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-02-09 00:10:56,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:10:56,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158095744]
[2022-02-09 00:10:56,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158095744] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:10:56,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:10:56,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:10:56,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784729678]
[2022-02-09 00:10:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:10:56,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:10:56,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:10:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:10:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:10:56,130 INFO L87 Difference]: Start difference. First operand 4884 states and 9996 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-02-09 00:10:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:10:59,550 INFO L93 Difference]: Finished difference Result 7608 states and 15611 transitions.
[2022-02-09 00:10:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:10:59,551 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-02-09 00:10:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:10:59,560 INFO L225 Difference]: With dead ends: 7608
[2022-02-09 00:10:59,560 INFO L226 Difference]: Without dead ends: 7608
[2022-02-09 00:10:59,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:10:59,565 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1669 mSDsluCounter, 9368 mSDsCounter, 0 mSdLazyCounter, 3652 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 9942 SdHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:10:59,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1669 Valid, 9942 Invalid, 3686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3652 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:10:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states.
[2022-02-09 00:10:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 4880.
[2022-02-09 00:10:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4877 states have (on average 2.04798031576789) internal successors, (9988), 4879 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:10:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 9988 transitions.
[2022-02-09 00:10:59,623 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 9988 transitions. Word has length 99
[2022-02-09 00:10:59,624 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:10:59,624 INFO L470 AbstractCegarLoop]: Abstraction has 4880 states and 9988 transitions.
[2022-02-09 00:10:59,624 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-02-09 00:10:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 9988 transitions.
[2022-02-09 00:10:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:10:59,627 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:10:59,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:10:59,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2022-02-09 00:10:59,627 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-02-09 00:10:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:10:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -778058441, now seen corresponding path program 46 times
[2022-02-09 00:10:59,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:10:59,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035281478]
[2022-02-09 00:10:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:10:59,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:10:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:00,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:00,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035281478]
[2022-02-09 00:11:00,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035281478] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:00,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:00,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:11:00,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363759596]
[2022-02-09 00:11:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:00,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:11:00,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:11:00,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:11:00,450 INFO L87 Difference]: Start difference. First operand 4880 states and 9988 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-02-09 00:11:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:04,453 INFO L93 Difference]: Finished difference Result 7693 states and 15781 transitions.
[2022-02-09 00:11:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:11:04,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-02-09 00:11:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:04,462 INFO L225 Difference]: With dead ends: 7693
[2022-02-09 00:11:04,462 INFO L226 Difference]: Without dead ends: 7693
[2022-02-09 00:11:04,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:11:04,463 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 1520 mSDsluCounter, 9500 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 10078 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:04,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1520 Valid, 10078 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:11:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states.
[2022-02-09 00:11:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 4874.
[2022-02-09 00:11:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions.
[2022-02-09 00:11:04,519 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99
[2022-02-09 00:11:04,519 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:04,519 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions.
[2022-02-09 00:11:04,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-02-09 00:11:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions.
[2022-02-09 00:11:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:04,522 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:04,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:04,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2022-02-09 00:11:04,522 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-02-09 00:11:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2006609387, now seen corresponding path program 47 times
[2022-02-09 00:11:04,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:04,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392049323]
[2022-02-09 00:11:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:04,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:05,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:05,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392049323]
[2022-02-09 00:11:05,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392049323] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:05,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:05,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:11:05,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551544669]
[2022-02-09 00:11:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:05,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:11:05,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:05,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:11:05,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:11:05,482 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 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-02-09 00:11:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:10,977 INFO L93 Difference]: Finished difference Result 7877 states and 16157 transitions.
[2022-02-09 00:11:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:11:10,977 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-02-09 00:11:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:10,985 INFO L225 Difference]: With dead ends: 7877
[2022-02-09 00:11:10,985 INFO L226 Difference]: Without dead ends: 7877
[2022-02-09 00:11:10,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:11:10,986 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1805 mSDsluCounter, 10129 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 10702 SdHoareTripleChecker+Invalid, 4078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:10,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1805 Valid, 10702 Invalid, 4078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:11:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states.
[2022-02-09 00:11:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 5241.
[2022-02-09 00:11:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5238 states have (on average 2.051546391752577) internal successors, (10746), 5240 states have internal predecessors, (10746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 10746 transitions.
[2022-02-09 00:11:11,040 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 10746 transitions. Word has length 99
[2022-02-09 00:11:11,040 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:11,040 INFO L470 AbstractCegarLoop]: Abstraction has 5241 states and 10746 transitions.
[2022-02-09 00:11:11,040 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-02-09 00:11:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 10746 transitions.
[2022-02-09 00:11:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:11,043 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:11,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:11,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2022-02-09 00:11:11,044 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-02-09 00:11:11,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash -904543407, now seen corresponding path program 48 times
[2022-02-09 00:11:11,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:11,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909976668]
[2022-02-09 00:11:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:11,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:11,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:11,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909976668]
[2022-02-09 00:11:11,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909976668] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:11,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:11,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:11:11,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600515773]
[2022-02-09 00:11:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:11,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:11:11,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:11:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:11:11,693 INFO L87 Difference]: Start difference. First operand 5241 states and 10746 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-02-09 00:11:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:14,999 INFO L93 Difference]: Finished difference Result 8656 states and 17763 transitions.
[2022-02-09 00:11:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:11:14,999 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-02-09 00:11:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:15,008 INFO L225 Difference]: With dead ends: 8656
[2022-02-09 00:11:15,008 INFO L226 Difference]: Without dead ends: 8656
[2022-02-09 00:11:15,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:11:15,011 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 1596 mSDsluCounter, 9357 mSDsCounter, 0 mSdLazyCounter, 3475 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 9926 SdHoareTripleChecker+Invalid, 3508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:15,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1596 Valid, 9926 Invalid, 3508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3475 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:11:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states.
[2022-02-09 00:11:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 4872.
[2022-02-09 00:11:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:11:15,067 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:11:15,067 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:15,067 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:11:15,067 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-02-09 00:11:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:11:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:15,070 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:15,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:15,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2022-02-09 00:11:15,070 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-02-09 00:11:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1348039269, now seen corresponding path program 49 times
[2022-02-09 00:11:15,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:15,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233772674]
[2022-02-09 00:11:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:15,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:15,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:15,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233772674]
[2022-02-09 00:11:15,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233772674] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:15,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:15,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:11:15,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713496039]
[2022-02-09 00:11:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:15,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:11:15,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:11:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:11:15,899 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:11:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:20,458 INFO L93 Difference]: Finished difference Result 7510 states and 15415 transitions.
[2022-02-09 00:11:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:11:20,458 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-02-09 00:11:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:20,466 INFO L225 Difference]: With dead ends: 7510
[2022-02-09 00:11:20,466 INFO L226 Difference]: Without dead ends: 7510
[2022-02-09 00:11:20,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:11:20,474 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1809 mSDsluCounter, 9882 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 10455 SdHoareTripleChecker+Invalid, 3913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:20,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1809 Valid, 10455 Invalid, 3913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:11:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states.
[2022-02-09 00:11:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 4904.
[2022-02-09 00:11:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4904 states, 4901 states have (on average 2.0481534380738626) internal successors, (10038), 4903 states have internal predecessors, (10038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 10038 transitions.
[2022-02-09 00:11:20,526 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 10038 transitions. Word has length 99
[2022-02-09 00:11:20,526 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:20,526 INFO L470 AbstractCegarLoop]: Abstraction has 4904 states and 10038 transitions.
[2022-02-09 00:11:20,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-02-09 00:11:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 10038 transitions.
[2022-02-09 00:11:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:20,530 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:20,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-02-09 00:11:20,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2022-02-09 00:11:20,530 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-02-09 00:11:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1255395757, now seen corresponding path program 50 times
[2022-02-09 00:11:20,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:20,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239738773]
[2022-02-09 00:11:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:20,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:21,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-02-09 00:11:21,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:21,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239738773]
[2022-02-09 00:11:21,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239738773] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:21,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:21,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:11:21,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798273760]
[2022-02-09 00:11:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:21,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:11:21,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:21,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:11:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:11:21,002 INFO L87 Difference]: Start difference. First operand 4904 states and 10038 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-02-09 00:11:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:25,304 INFO L93 Difference]: Finished difference Result 9457 states and 19418 transitions.
[2022-02-09 00:11:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:11:25,304 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-02-09 00:11:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:25,314 INFO L225 Difference]: With dead ends: 9457
[2022-02-09 00:11:25,314 INFO L226 Difference]: Without dead ends: 9457
[2022-02-09 00:11:25,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:11:25,316 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 1590 mSDsluCounter, 11957 mSDsCounter, 0 mSdLazyCounter, 4423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 12576 SdHoareTripleChecker+Invalid, 4457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:25,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1590 Valid, 12576 Invalid, 4457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4423 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:11:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9457 states.
[2022-02-09 00:11:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9457 to 4906.
[2022-02-09 00:11:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4903 states have (on average 2.048133795635325) internal successors, (10042), 4905 states have internal predecessors, (10042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 10042 transitions.
[2022-02-09 00:11:25,377 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 10042 transitions. Word has length 99
[2022-02-09 00:11:25,377 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:25,377 INFO L470 AbstractCegarLoop]: Abstraction has 4906 states and 10042 transitions.
[2022-02-09 00:11:25,377 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-02-09 00:11:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 10042 transitions.
[2022-02-09 00:11:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:25,380 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:25,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:25,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2022-02-09 00:11:25,380 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-02-09 00:11:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1832402115, now seen corresponding path program 51 times
[2022-02-09 00:11:25,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:25,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722969120]
[2022-02-09 00:11:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:25,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:26,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:26,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722969120]
[2022-02-09 00:11:26,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722969120] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:26,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:26,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:11:26,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234058841]
[2022-02-09 00:11:26,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:26,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:11:26,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:26,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:11:26,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:11:26,056 INFO L87 Difference]: Start difference. First operand 4906 states and 10042 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-02-09 00:11:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:29,375 INFO L93 Difference]: Finished difference Result 7567 states and 15512 transitions.
[2022-02-09 00:11:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:11:29,375 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-02-09 00:11:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:29,384 INFO L225 Difference]: With dead ends: 7567
[2022-02-09 00:11:29,384 INFO L226 Difference]: Without dead ends: 7567
[2022-02-09 00:11:29,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:11:29,385 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 1771 mSDsluCounter, 9979 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 10566 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:29,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1771 Valid, 10566 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:11:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states.
[2022-02-09 00:11:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 4888.
[2022-02-09 00:11:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4885 states have (on average 2.0479017400204707) internal successors, (10004), 4887 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10004 transitions.
[2022-02-09 00:11:29,438 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10004 transitions. Word has length 99
[2022-02-09 00:11:29,438 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:29,438 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 10004 transitions.
[2022-02-09 00:11:29,438 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-02-09 00:11:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10004 transitions.
[2022-02-09 00:11:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:29,441 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:29,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:29,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2022-02-09 00:11:29,441 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-02-09 00:11:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash -222551165, now seen corresponding path program 52 times
[2022-02-09 00:11:29,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:29,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113742051]
[2022-02-09 00:11:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:29,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:30,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:30,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113742051]
[2022-02-09 00:11:30,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113742051] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:30,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:30,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:11:30,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871536600]
[2022-02-09 00:11:30,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:30,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:11:30,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:30,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:11:30,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:11:30,259 INFO L87 Difference]: Start difference. First operand 4888 states and 10004 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-02-09 00:11:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:34,715 INFO L93 Difference]: Finished difference Result 8631 states and 17745 transitions.
[2022-02-09 00:11:34,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:11:34,715 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-02-09 00:11:34,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:34,725 INFO L225 Difference]: With dead ends: 8631
[2022-02-09 00:11:34,725 INFO L226 Difference]: Without dead ends: 8631
[2022-02-09 00:11:34,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:11:34,726 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 2137 mSDsluCounter, 10541 mSDsCounter, 0 mSdLazyCounter, 4251 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 11122 SdHoareTripleChecker+Invalid, 4305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:34,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2137 Valid, 11122 Invalid, 4305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4251 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:11:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states.
[2022-02-09 00:11:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 5153.
[2022-02-09 00:11:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5153 states, 5150 states have (on average 2.0524271844660196) internal successors, (10570), 5152 states have internal predecessors, (10570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 10570 transitions.
[2022-02-09 00:11:34,786 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 10570 transitions. Word has length 99
[2022-02-09 00:11:34,786 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:34,786 INFO L470 AbstractCegarLoop]: Abstraction has 5153 states and 10570 transitions.
[2022-02-09 00:11:34,786 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-02-09 00:11:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 10570 transitions.
[2022-02-09 00:11:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:34,790 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:34,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:34,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2022-02-09 00:11:34,790 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-02-09 00:11:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash 879514815, now seen corresponding path program 53 times
[2022-02-09 00:11:34,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:34,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73257797]
[2022-02-09 00:11:34,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:34,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:35,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:35,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73257797]
[2022-02-09 00:11:35,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73257797] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:35,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:35,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:11:35,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077052801]
[2022-02-09 00:11:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:35,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:11:35,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:11:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:11:35,384 INFO L87 Difference]: Start difference. First operand 5153 states and 10570 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-02-09 00:11:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:39,294 INFO L93 Difference]: Finished difference Result 9047 states and 18581 transitions.
[2022-02-09 00:11:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:11:39,294 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-02-09 00:11:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:39,304 INFO L225 Difference]: With dead ends: 9047
[2022-02-09 00:11:39,304 INFO L226 Difference]: Without dead ends: 9047
[2022-02-09 00:11:39,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:11:39,305 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1672 mSDsluCounter, 10537 mSDsCounter, 0 mSdLazyCounter, 4061 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 11114 SdHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:39,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1672 Valid, 11114 Invalid, 4103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4061 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:11:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9047 states.
[2022-02-09 00:11:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9047 to 4886.
[2022-02-09 00:11:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4886 states, 4883 states have (on average 2.047921359819783) internal successors, (10000), 4885 states have internal predecessors, (10000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 10000 transitions.
[2022-02-09 00:11:39,365 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 10000 transitions. Word has length 99
[2022-02-09 00:11:39,365 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:39,365 INFO L470 AbstractCegarLoop]: Abstraction has 4886 states and 10000 transitions.
[2022-02-09 00:11:39,365 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-02-09 00:11:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 10000 transitions.
[2022-02-09 00:11:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:39,368 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:39,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:39,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2022-02-09 00:11:39,369 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-02-09 00:11:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1889966245, now seen corresponding path program 54 times
[2022-02-09 00:11:39,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:39,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196200846]
[2022-02-09 00:11:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:39,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:40,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:40,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196200846]
[2022-02-09 00:11:40,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196200846] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:40,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:40,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:11:40,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73636373]
[2022-02-09 00:11:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:40,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:11:40,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:11:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:11:40,528 INFO L87 Difference]: Start difference. First operand 4886 states and 10000 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-02-09 00:11:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:47,503 INFO L93 Difference]: Finished difference Result 8682 states and 17847 transitions.
[2022-02-09 00:11:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:11:47,503 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-02-09 00:11:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:47,513 INFO L225 Difference]: With dead ends: 8682
[2022-02-09 00:11:47,513 INFO L226 Difference]: Without dead ends: 8682
[2022-02-09 00:11:47,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:11:47,514 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 2006 mSDsluCounter, 10881 mSDsCounter, 0 mSdLazyCounter, 4550 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 11461 SdHoareTripleChecker+Invalid, 4599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:47,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2006 Valid, 11461 Invalid, 4599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4550 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2022-02-09 00:11:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states.
[2022-02-09 00:11:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 5185.
[2022-02-09 00:11:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 5182 states have (on average 2.052103434967194) internal successors, (10634), 5184 states have internal predecessors, (10634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 10634 transitions.
[2022-02-09 00:11:47,585 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 10634 transitions. Word has length 99
[2022-02-09 00:11:47,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:47,586 INFO L470 AbstractCegarLoop]: Abstraction has 5185 states and 10634 transitions.
[2022-02-09 00:11:47,586 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-02-09 00:11:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 10634 transitions.
[2022-02-09 00:11:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:47,589 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:47,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:47,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2022-02-09 00:11:47,590 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-02-09 00:11:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1302935071, now seen corresponding path program 55 times
[2022-02-09 00:11:47,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:47,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006245398]
[2022-02-09 00:11:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:47,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:48,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:48,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006245398]
[2022-02-09 00:11:48,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006245398] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:48,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:48,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:11:48,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764744575]
[2022-02-09 00:11:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:48,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:11:48,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:11:48,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:11:48,779 INFO L87 Difference]: Start difference. First operand 5185 states and 10634 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-02-09 00:11:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:11:53,767 INFO L93 Difference]: Finished difference Result 9098 states and 18683 transitions.
[2022-02-09 00:11:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:11:53,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-02-09 00:11:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:11:53,779 INFO L225 Difference]: With dead ends: 9098
[2022-02-09 00:11:53,779 INFO L226 Difference]: Without dead ends: 9098
[2022-02-09 00:11:53,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:11:53,780 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1537 mSDsluCounter, 9821 mSDsCounter, 0 mSdLazyCounter, 3763 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 10397 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:11:53,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 10397 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3763 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:11:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states.
[2022-02-09 00:11:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 4882.
[2022-02-09 00:11:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4879 states have (on average 2.047960647673704) internal successors, (9992), 4881 states have internal predecessors, (9992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:11:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 9992 transitions.
[2022-02-09 00:11:53,854 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 9992 transitions. Word has length 99
[2022-02-09 00:11:53,854 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:11:53,854 INFO L470 AbstractCegarLoop]: Abstraction has 4882 states and 9992 transitions.
[2022-02-09 00:11:53,854 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-02-09 00:11:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 9992 transitions.
[2022-02-09 00:11:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:11:53,858 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:11:53,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:11:53,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2022-02-09 00:11:53,858 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-02-09 00:11:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:11:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash -681518747, now seen corresponding path program 56 times
[2022-02-09 00:11:53,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:11:53,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099738809]
[2022-02-09 00:11:53,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:11:53,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:11:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:11:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:11:54,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:11:54,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099738809]
[2022-02-09 00:11:54,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099738809] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:11:54,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:11:54,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:11:54,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680868455]
[2022-02-09 00:11:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:11:54,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:11:54,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:11:54,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:11:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:11:54,890 INFO L87 Difference]: Start difference. First operand 4882 states and 9992 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-02-09 00:12:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:00,839 INFO L93 Difference]: Finished difference Result 8404 states and 17247 transitions.
[2022-02-09 00:12:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:12:00,840 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-02-09 00:12:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:00,851 INFO L225 Difference]: With dead ends: 8404
[2022-02-09 00:12:00,851 INFO L226 Difference]: Without dead ends: 8404
[2022-02-09 00:12:00,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1131, Invalid=5675, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:12:00,863 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 1839 mSDsluCounter, 10404 mSDsCounter, 0 mSdLazyCounter, 4172 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 10988 SdHoareTripleChecker+Invalid, 4217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:00,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1839 Valid, 10988 Invalid, 4217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4172 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-02-09 00:12:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8404 states.
[2022-02-09 00:12:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8404 to 5232.
[2022-02-09 00:12:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5232 states, 5229 states have (on average 2.0516351118760756) internal successors, (10728), 5231 states have internal predecessors, (10728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 10728 transitions.
[2022-02-09 00:12:00,947 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 10728 transitions. Word has length 99
[2022-02-09 00:12:00,947 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:00,947 INFO L470 AbstractCegarLoop]: Abstraction has 5232 states and 10728 transitions.
[2022-02-09 00:12:00,947 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-02-09 00:12:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 10728 transitions.
[2022-02-09 00:12:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:00,951 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:00,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:00,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2022-02-09 00:12:00,951 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-02-09 00:12:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 420547233, now seen corresponding path program 57 times
[2022-02-09 00:12:00,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:00,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951634939]
[2022-02-09 00:12:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:00,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:01,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:01,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951634939]
[2022-02-09 00:12:01,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951634939] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:01,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:01,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:12:01,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544925922]
[2022-02-09 00:12:01,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:01,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:12:01,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:01,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:12:01,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:12:01,823 INFO L87 Difference]: Start difference. First operand 5232 states and 10728 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-02-09 00:12:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:05,766 INFO L93 Difference]: Finished difference Result 9183 states and 18853 transitions.
[2022-02-09 00:12:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:05,766 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-02-09 00:12:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:05,777 INFO L225 Difference]: With dead ends: 9183
[2022-02-09 00:12:05,777 INFO L226 Difference]: Without dead ends: 9183
[2022-02-09 00:12:05,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:12:05,778 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1702 mSDsluCounter, 10281 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 10861 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:05,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 10861 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:12:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9183 states.
[2022-02-09 00:12:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9183 to 4876.
[2022-02-09 00:12:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4873 states have (on average 2.0480197003899034) internal successors, (9980), 4875 states have internal predecessors, (9980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 9980 transitions.
[2022-02-09 00:12:05,843 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 9980 transitions. Word has length 99
[2022-02-09 00:12:05,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:05,843 INFO L470 AbstractCegarLoop]: Abstraction has 4876 states and 9980 transitions.
[2022-02-09 00:12:05,843 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-02-09 00:12:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 9980 transitions.
[2022-02-09 00:12:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:05,847 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:05,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:05,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2022-02-09 00:12:05,848 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-02-09 00:12:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1910069693, now seen corresponding path program 58 times
[2022-02-09 00:12:05,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:05,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422186205]
[2022-02-09 00:12:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:05,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:06,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:06,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422186205]
[2022-02-09 00:12:06,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422186205] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:06,662 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:06,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:12:06,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391597247]
[2022-02-09 00:12:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:06,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:12:06,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:06,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:12:06,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:12:06,663 INFO L87 Difference]: Start difference. First operand 4876 states and 9980 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-02-09 00:12:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:10,212 INFO L93 Difference]: Finished difference Result 7799 states and 15993 transitions.
[2022-02-09 00:12:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:10,212 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-02-09 00:12:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:10,221 INFO L225 Difference]: With dead ends: 7799
[2022-02-09 00:12:10,221 INFO L226 Difference]: Without dead ends: 7799
[2022-02-09 00:12:10,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:12:10,222 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 1692 mSDsluCounter, 10232 mSDsCounter, 0 mSdLazyCounter, 3786 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 10814 SdHoareTripleChecker+Invalid, 3823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:10,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1692 Valid, 10814 Invalid, 3823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3786 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:12:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7799 states.
[2022-02-09 00:12:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7799 to 4874.
[2022-02-09 00:12:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4871 states have (on average 2.048039416957504) internal successors, (9976), 4873 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9976 transitions.
[2022-02-09 00:12:10,283 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9976 transitions. Word has length 99
[2022-02-09 00:12:10,283 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:10,283 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9976 transitions.
[2022-02-09 00:12:10,283 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-02-09 00:12:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9976 transitions.
[2022-02-09 00:12:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:10,287 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:10,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:10,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2022-02-09 00:12:10,288 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-02-09 00:12:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1959007845, now seen corresponding path program 59 times
[2022-02-09 00:12:10,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:10,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204353482]
[2022-02-09 00:12:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:10,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:11,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:11,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204353482]
[2022-02-09 00:12:11,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204353482] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:11,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:11,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:12:11,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483779865]
[2022-02-09 00:12:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:11,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:12:11,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:12:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:12:11,089 INFO L87 Difference]: Start difference. First operand 4874 states and 9976 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-02-09 00:12:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:17,019 INFO L93 Difference]: Finished difference Result 7913 states and 16229 transitions.
[2022-02-09 00:12:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:12:17,019 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-02-09 00:12:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:17,030 INFO L225 Difference]: With dead ends: 7913
[2022-02-09 00:12:17,030 INFO L226 Difference]: Without dead ends: 7913
[2022-02-09 00:12:17,031 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-02-09 00:12:17,032 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1712 mSDsluCounter, 10665 mSDsCounter, 0 mSdLazyCounter, 4300 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 11239 SdHoareTripleChecker+Invalid, 4342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:17,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1712 Valid, 11239 Invalid, 4342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4300 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-02-09 00:12:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states.
[2022-02-09 00:12:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 5258.
[2022-02-09 00:12:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5258 states, 5255 states have (on average 2.0513796384395815) internal successors, (10780), 5257 states have internal predecessors, (10780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 10780 transitions.
[2022-02-09 00:12:17,109 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 10780 transitions. Word has length 99
[2022-02-09 00:12:17,109 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:17,109 INFO L470 AbstractCegarLoop]: Abstraction has 5258 states and 10780 transitions.
[2022-02-09 00:12:17,109 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-02-09 00:12:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 10780 transitions.
[2022-02-09 00:12:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:17,113 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:17,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:17,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85
[2022-02-09 00:12:17,113 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-02-09 00:12:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:17,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1233893471, now seen corresponding path program 60 times
[2022-02-09 00:12:17,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:17,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84292784]
[2022-02-09 00:12:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:17,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:18,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:18,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84292784]
[2022-02-09 00:12:18,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84292784] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:18,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:18,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:12:18,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205281531]
[2022-02-09 00:12:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:18,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:12:18,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:18,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:12:18,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:12:18,038 INFO L87 Difference]: Start difference. First operand 5258 states and 10780 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-02-09 00:12:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:21,919 INFO L93 Difference]: Finished difference Result 8692 states and 17835 transitions.
[2022-02-09 00:12:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:21,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-02-09 00:12:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:21,930 INFO L225 Difference]: With dead ends: 8692
[2022-02-09 00:12:21,930 INFO L226 Difference]: Without dead ends: 8692
[2022-02-09 00:12:21,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:12:21,931 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1568 mSDsluCounter, 10032 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 10602 SdHoareTripleChecker+Invalid, 3745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:21,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1568 Valid, 10602 Invalid, 3745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:12:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states.
[2022-02-09 00:12:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 4872.
[2022-02-09 00:12:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:12:21,992 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:12:21,992 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:21,992 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:12:21,992 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-02-09 00:12:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:12:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:21,995 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:21,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:21,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86
[2022-02-09 00:12:21,995 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-02-09 00:12:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1893386159, now seen corresponding path program 61 times
[2022-02-09 00:12:21,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:21,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671128221]
[2022-02-09 00:12:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:21,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:22,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:22,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671128221]
[2022-02-09 00:12:22,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671128221] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:22,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:22,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:12:22,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343499126]
[2022-02-09 00:12:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:22,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:12:22,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:22,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:12:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:12:22,682 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:12:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:26,877 INFO L93 Difference]: Finished difference Result 7206 states and 14788 transitions.
[2022-02-09 00:12:26,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:26,877 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-02-09 00:12:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:26,887 INFO L225 Difference]: With dead ends: 7206
[2022-02-09 00:12:26,887 INFO L226 Difference]: Without dead ends: 7206
[2022-02-09 00:12:26,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:12:26,888 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1628 mSDsluCounter, 8780 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 9356 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:26,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 9356 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3176 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:12:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states.
[2022-02-09 00:12:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 4910.
[2022-02-09 00:12:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 4907 states have (on average 2.04809455879356) internal successors, (10050), 4909 states have internal predecessors, (10050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 10050 transitions.
[2022-02-09 00:12:26,955 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 10050 transitions. Word has length 99
[2022-02-09 00:12:26,955 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:26,955 INFO L470 AbstractCegarLoop]: Abstraction has 4910 states and 10050 transitions.
[2022-02-09 00:12:26,956 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-02-09 00:12:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 10050 transitions.
[2022-02-09 00:12:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:26,960 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:26,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:26,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87
[2022-02-09 00:12:26,960 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-02-09 00:12:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:26,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1986029671, now seen corresponding path program 62 times
[2022-02-09 00:12:26,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:26,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017684857]
[2022-02-09 00:12:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:26,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:27,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:27,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017684857]
[2022-02-09 00:12:27,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017684857] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:27,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:27,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:12:27,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272126818]
[2022-02-09 00:12:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:27,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:12:27,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:12:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:12:27,850 INFO L87 Difference]: Start difference. First operand 4910 states and 10050 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-02-09 00:12:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:32,942 INFO L93 Difference]: Finished difference Result 9153 states and 18791 transitions.
[2022-02-09 00:12:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:12:32,943 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-02-09 00:12:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:32,954 INFO L225 Difference]: With dead ends: 9153
[2022-02-09 00:12:32,954 INFO L226 Difference]: Without dead ends: 9153
[2022-02-09 00:12:32,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:12:32,955 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 1666 mSDsluCounter, 10217 mSDsCounter, 0 mSdLazyCounter, 3620 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 10839 SdHoareTripleChecker+Invalid, 3661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:32,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1666 Valid, 10839 Invalid, 3661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3620 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:12:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9153 states.
[2022-02-09 00:12:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9153 to 4912.
[2022-02-09 00:12:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4912 states, 4909 states have (on average 2.0480749643511915) internal successors, (10054), 4911 states have internal predecessors, (10054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10054 transitions.
[2022-02-09 00:12:33,023 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10054 transitions. Word has length 99
[2022-02-09 00:12:33,023 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:33,023 INFO L470 AbstractCegarLoop]: Abstraction has 4912 states and 10054 transitions.
[2022-02-09 00:12:33,024 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-02-09 00:12:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10054 transitions.
[2022-02-09 00:12:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:33,027 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:33,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:33,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88
[2022-02-09 00:12:33,027 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-02-09 00:12:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash -778860247, now seen corresponding path program 63 times
[2022-02-09 00:12:33,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:33,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377099548]
[2022-02-09 00:12:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:33,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:33,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:33,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377099548]
[2022-02-09 00:12:33,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377099548] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:33,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:33,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:12:33,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614176867]
[2022-02-09 00:12:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:33,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:12:33,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:33,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:12:33,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:12:33,910 INFO L87 Difference]: Start difference. First operand 4912 states and 10054 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-02-09 00:12:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:39,043 INFO L93 Difference]: Finished difference Result 7263 states and 14885 transitions.
[2022-02-09 00:12:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:39,044 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-02-09 00:12:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:39,053 INFO L225 Difference]: With dead ends: 7263
[2022-02-09 00:12:39,054 INFO L226 Difference]: Without dead ends: 7263
[2022-02-09 00:12:39,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=955, Invalid=4745, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:12:39,054 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1503 mSDsluCounter, 10879 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 11469 SdHoareTripleChecker+Invalid, 4078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:39,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 11469 Invalid, 4078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-09 00:12:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7263 states.
[2022-02-09 00:12:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7263 to 4894.
[2022-02-09 00:12:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 4891 states have (on average 2.0478429768963404) internal successors, (10016), 4893 states have internal predecessors, (10016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 10016 transitions.
[2022-02-09 00:12:39,126 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 10016 transitions. Word has length 99
[2022-02-09 00:12:39,127 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:39,127 INFO L470 AbstractCegarLoop]: Abstraction has 4894 states and 10016 transitions.
[2022-02-09 00:12:39,127 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-02-09 00:12:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 10016 transitions.
[2022-02-09 00:12:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:39,131 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:39,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-02-09 00:12:39,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89
[2022-02-09 00:12:39,131 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-02-09 00:12:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash 830990703, now seen corresponding path program 64 times
[2022-02-09 00:12:39,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:39,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837264659]
[2022-02-09 00:12:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:39,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:40,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:40,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837264659]
[2022-02-09 00:12:40,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837264659] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:40,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:40,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:12:40,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912771159]
[2022-02-09 00:12:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:40,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:12:40,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:40,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:12:40,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:12:40,009 INFO L87 Difference]: Start difference. First operand 4894 states and 10016 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-02-09 00:12:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:44,754 INFO L93 Difference]: Finished difference Result 7291 states and 14958 transitions.
[2022-02-09 00:12:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:44,754 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-02-09 00:12:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:44,764 INFO L225 Difference]: With dead ends: 7291
[2022-02-09 00:12:44,764 INFO L226 Difference]: Without dead ends: 7291
[2022-02-09 00:12:44,765 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-02-09 00:12:44,765 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 1745 mSDsluCounter, 9585 mSDsCounter, 0 mSdLazyCounter, 3736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 10165 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:44,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1745 Valid, 10165 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3736 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:12:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7291 states.
[2022-02-09 00:12:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7291 to 4892.
[2022-02-09 00:12:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4889 states have (on average 2.047862548578441) internal successors, (10012), 4891 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 10012 transitions.
[2022-02-09 00:12:44,828 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 10012 transitions. Word has length 99
[2022-02-09 00:12:44,828 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:44,828 INFO L470 AbstractCegarLoop]: Abstraction has 4892 states and 10012 transitions.
[2022-02-09 00:12:44,828 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-02-09 00:12:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 10012 transitions.
[2022-02-09 00:12:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:44,832 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:44,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:44,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90
[2022-02-09 00:12:44,832 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-02-09 00:12:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1351459183, now seen corresponding path program 65 times
[2022-02-09 00:12:44,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:44,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373561448]
[2022-02-09 00:12:44,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:44,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:45,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:45,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373561448]
[2022-02-09 00:12:45,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373561448] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:45,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:45,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:12:45,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014358854]
[2022-02-09 00:12:45,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:45,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:12:45,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:45,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:12:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:12:45,926 INFO L87 Difference]: Start difference. First operand 4892 states and 10012 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-02-09 00:12:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:50,649 INFO L93 Difference]: Finished difference Result 8378 states and 17220 transitions.
[2022-02-09 00:12:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:12:50,649 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-02-09 00:12:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:50,661 INFO L225 Difference]: With dead ends: 8378
[2022-02-09 00:12:50,661 INFO L226 Difference]: Without dead ends: 8378
[2022-02-09 00:12:50,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:12:50,662 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 1878 mSDsluCounter, 11571 mSDsCounter, 0 mSdLazyCounter, 4692 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 12154 SdHoareTripleChecker+Invalid, 4739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:50,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1878 Valid, 12154 Invalid, 4739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4692 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:12:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states.
[2022-02-09 00:12:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 5191.
[2022-02-09 00:12:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 5188 states have (on average 2.052043176561295) internal successors, (10646), 5190 states have internal predecessors, (10646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 10646 transitions.
[2022-02-09 00:12:50,737 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 10646 transitions. Word has length 99
[2022-02-09 00:12:50,737 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:50,737 INFO L470 AbstractCegarLoop]: Abstraction has 5191 states and 10646 transitions.
[2022-02-09 00:12:50,737 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-02-09 00:12:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 10646 transitions.
[2022-02-09 00:12:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:50,742 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:50,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:50,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91
[2022-02-09 00:12:50,742 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-02-09 00:12:50,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash -249393203, now seen corresponding path program 66 times
[2022-02-09 00:12:50,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:50,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849848017]
[2022-02-09 00:12:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:50,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:51,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:51,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849848017]
[2022-02-09 00:12:51,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849848017] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:51,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:51,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:12:51,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49524048]
[2022-02-09 00:12:51,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:51,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:12:51,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:12:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:12:51,356 INFO L87 Difference]: Start difference. First operand 5191 states and 10646 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-02-09 00:12:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:55,401 INFO L93 Difference]: Finished difference Result 8794 states and 18056 transitions.
[2022-02-09 00:12:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:55,401 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-02-09 00:12:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:55,411 INFO L225 Difference]: With dead ends: 8794
[2022-02-09 00:12:55,412 INFO L226 Difference]: Without dead ends: 8794
[2022-02-09 00:12:55,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:12:55,412 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1636 mSDsluCounter, 9253 mSDsCounter, 0 mSdLazyCounter, 3541 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 9832 SdHoareTripleChecker+Invalid, 3575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:55,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1636 Valid, 9832 Invalid, 3575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3541 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:12:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8794 states.
[2022-02-09 00:12:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8794 to 4888.
[2022-02-09 00:12:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4885 states have (on average 2.0479017400204707) internal successors, (10004), 4887 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10004 transitions.
[2022-02-09 00:12:55,469 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10004 transitions. Word has length 99
[2022-02-09 00:12:55,469 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:55,469 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 10004 transitions.
[2022-02-09 00:12:55,469 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-02-09 00:12:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10004 transitions.
[2022-02-09 00:12:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:55,472 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:55,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:55,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92
[2022-02-09 00:12:55,473 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-02-09 00:12:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 372023121, now seen corresponding path program 67 times
[2022-02-09 00:12:55,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:55,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302191602]
[2022-02-09 00:12:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:55,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:12:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:12:56,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:12:56,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302191602]
[2022-02-09 00:12:56,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302191602] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:12:56,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:12:56,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:12:56,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645426614]
[2022-02-09 00:12:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:12:56,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:12:56,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:12:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:12:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:12:56,136 INFO L87 Difference]: Start difference. First operand 4888 states and 10004 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-02-09 00:12:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:12:59,595 INFO L93 Difference]: Finished difference Result 7427 states and 15230 transitions.
[2022-02-09 00:12:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:12:59,596 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-02-09 00:12:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:12:59,604 INFO L225 Difference]: With dead ends: 7427
[2022-02-09 00:12:59,604 INFO L226 Difference]: Without dead ends: 7427
[2022-02-09 00:12:59,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=960, Invalid=4740, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:12:59,605 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 1563 mSDsluCounter, 10682 mSDsCounter, 0 mSdLazyCounter, 4111 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 11265 SdHoareTripleChecker+Invalid, 4147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:12:59,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1563 Valid, 11265 Invalid, 4147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4111 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:12:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states.
[2022-02-09 00:12:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 4882.
[2022-02-09 00:12:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4879 states have (on average 2.047960647673704) internal successors, (9992), 4881 states have internal predecessors, (9992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:12:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 9992 transitions.
[2022-02-09 00:12:59,656 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 9992 transitions. Word has length 99
[2022-02-09 00:12:59,656 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:12:59,656 INFO L470 AbstractCegarLoop]: Abstraction has 4882 states and 9992 transitions.
[2022-02-09 00:12:59,656 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-02-09 00:12:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 9992 transitions.
[2022-02-09 00:12:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:12:59,659 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:12:59,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:12:59,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93
[2022-02-09 00:12:59,659 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-02-09 00:12:59,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:12:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash -856527825, now seen corresponding path program 68 times
[2022-02-09 00:12:59,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:12:59,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445556512]
[2022-02-09 00:12:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:12:59,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:12:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:00,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:00,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445556512]
[2022-02-09 00:13:00,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445556512] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:00,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:00,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:13:00,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59862513]
[2022-02-09 00:13:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:00,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:13:00,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:00,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:13:00,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:13:00,252 INFO L87 Difference]: Start difference. First operand 4882 states and 9992 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-02-09 00:13:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:03,426 INFO L93 Difference]: Finished difference Result 7495 states and 15366 transitions.
[2022-02-09 00:13:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:13:03,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-02-09 00:13:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:03,437 INFO L225 Difference]: With dead ends: 7495
[2022-02-09 00:13:03,437 INFO L226 Difference]: Without dead ends: 7495
[2022-02-09 00:13:03,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=945, Invalid=4605, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:13:03,438 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1667 mSDsluCounter, 8993 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 9578 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:03,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1667 Valid, 9578 Invalid, 3465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:13:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7495 states.
[2022-02-09 00:13:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7495 to 4880.
[2022-02-09 00:13:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4877 states have (on average 2.04798031576789) internal successors, (9988), 4879 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 9988 transitions.
[2022-02-09 00:13:03,496 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 9988 transitions. Word has length 99
[2022-02-09 00:13:03,496 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:03,497 INFO L470 AbstractCegarLoop]: Abstraction has 4880 states and 9988 transitions.
[2022-02-09 00:13:03,497 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-02-09 00:13:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 9988 transitions.
[2022-02-09 00:13:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:03,500 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:03,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:03,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94
[2022-02-09 00:13:03,500 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-02-09 00:13:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1282417583, now seen corresponding path program 69 times
[2022-02-09 00:13:03,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:03,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101073682]
[2022-02-09 00:13:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:03,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:04,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:04,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101073682]
[2022-02-09 00:13:04,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101073682] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:04,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:04,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:13:04,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149286526]
[2022-02-09 00:13:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:04,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:13:04,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:13:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:13:04,282 INFO L87 Difference]: Start difference. First operand 4880 states and 9988 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-02-09 00:13:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:10,929 INFO L93 Difference]: Finished difference Result 8565 states and 17594 transitions.
[2022-02-09 00:13:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:13:10,929 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-02-09 00:13:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:10,939 INFO L225 Difference]: With dead ends: 8565
[2022-02-09 00:13:10,939 INFO L226 Difference]: Without dead ends: 8565
[2022-02-09 00:13:10,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:13:10,940 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 2155 mSDsluCounter, 10796 mSDsCounter, 0 mSdLazyCounter, 4466 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 11386 SdHoareTripleChecker+Invalid, 4521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:10,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2155 Valid, 11386 Invalid, 4521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4466 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2022-02-09 00:13:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states.
[2022-02-09 00:13:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 5264.
[2022-02-09 00:13:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5264 states, 5261 states have (on average 2.0513210416270673) internal successors, (10792), 5263 states have internal predecessors, (10792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 10792 transitions.
[2022-02-09 00:13:11,003 INFO L78 Accepts]: Start accepts. Automaton has 5264 states and 10792 transitions. Word has length 99
[2022-02-09 00:13:11,003 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:11,003 INFO L470 AbstractCegarLoop]: Abstraction has 5264 states and 10792 transitions.
[2022-02-09 00:13:11,003 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-02-09 00:13:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5264 states and 10792 transitions.
[2022-02-09 00:13:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:11,007 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:11,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:11,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95
[2022-02-09 00:13:11,007 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-02-09 00:13:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash -180351603, now seen corresponding path program 70 times
[2022-02-09 00:13:11,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:11,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322748505]
[2022-02-09 00:13:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:11,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:11,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:11,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322748505]
[2022-02-09 00:13:11,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322748505] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:11,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:11,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:13:11,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140224255]
[2022-02-09 00:13:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:11,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:13:11,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:13:11,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:13:11,975 INFO L87 Difference]: Start difference. First operand 5264 states and 10792 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-02-09 00:13:15,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:15,381 INFO L93 Difference]: Finished difference Result 8981 states and 18430 transitions.
[2022-02-09 00:13:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:13:15,382 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-02-09 00:13:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:15,392 INFO L225 Difference]: With dead ends: 8981
[2022-02-09 00:13:15,392 INFO L226 Difference]: Without dead ends: 8981
[2022-02-09 00:13:15,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:13:15,393 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 1548 mSDsluCounter, 9410 mSDsCounter, 0 mSdLazyCounter, 3546 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 9996 SdHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:15,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 9996 Invalid, 3579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3546 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:13:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8981 states.
[2022-02-09 00:13:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8981 to 4878.
[2022-02-09 00:13:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4875 states have (on average 2.048) internal successors, (9984), 4877 states have internal predecessors, (9984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 9984 transitions.
[2022-02-09 00:13:15,456 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 9984 transitions. Word has length 99
[2022-02-09 00:13:15,456 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:15,456 INFO L470 AbstractCegarLoop]: Abstraction has 4878 states and 9984 transitions.
[2022-02-09 00:13:15,457 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-02-09 00:13:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 9984 transitions.
[2022-02-09 00:13:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:15,460 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:15,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:15,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96
[2022-02-09 00:13:15,460 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-02-09 00:13:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1718301777, now seen corresponding path program 71 times
[2022-02-09 00:13:15,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:15,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068504185]
[2022-02-09 00:13:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:15,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:16,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:16,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068504185]
[2022-02-09 00:13:16,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068504185] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:16,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:16,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:13:16,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645990985]
[2022-02-09 00:13:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:16,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:13:16,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:13:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:13:16,104 INFO L87 Difference]: Start difference. First operand 4878 states and 9984 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-02-09 00:13:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:19,591 INFO L93 Difference]: Finished difference Result 6934 states and 14208 transitions.
[2022-02-09 00:13:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:13:19,591 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-02-09 00:13:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:19,601 INFO L225 Difference]: With dead ends: 6934
[2022-02-09 00:13:19,601 INFO L226 Difference]: Without dead ends: 6934
[2022-02-09 00:13:19,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=959, Invalid=4741, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:13:19,602 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1641 mSDsluCounter, 10269 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 10843 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:19,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1641 Valid, 10843 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3692 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:13:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6934 states.
[2022-02-09 00:13:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6934 to 4872.
[2022-02-09 00:13:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:13:19,663 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:13:19,663 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:19,663 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:13:19,663 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-02-09 00:13:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:13:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:19,667 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:19,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:19,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97
[2022-02-09 00:13:19,667 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-02-09 00:13:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -86186341, now seen corresponding path program 72 times
[2022-02-09 00:13:19,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:19,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858174973]
[2022-02-09 00:13:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:19,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:20,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-02-09 00:13:20,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:20,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858174973]
[2022-02-09 00:13:20,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858174973] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:20,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:20,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:13:20,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889513389]
[2022-02-09 00:13:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:20,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:13:20,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:20,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:13:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:13:20,275 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:13:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:24,611 INFO L93 Difference]: Finished difference Result 6530 states and 13401 transitions.
[2022-02-09 00:13:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:13:24,611 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-02-09 00:13:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:24,619 INFO L225 Difference]: With dead ends: 6530
[2022-02-09 00:13:24,619 INFO L226 Difference]: Without dead ends: 6530
[2022-02-09 00:13:24,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:13:24,620 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1689 mSDsluCounter, 9441 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 9993 SdHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:24,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1689 Valid, 9993 Invalid, 3747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:13:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states.
[2022-02-09 00:13:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 4896.
[2022-02-09 00:13:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4893 states have (on average 2.0484365419987736) internal successors, (10023), 4895 states have internal predecessors, (10023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10023 transitions.
[2022-02-09 00:13:24,680 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10023 transitions. Word has length 99
[2022-02-09 00:13:24,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:24,680 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 10023 transitions.
[2022-02-09 00:13:24,680 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-02-09 00:13:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10023 transitions.
[2022-02-09 00:13:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:24,683 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:24,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:24,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98
[2022-02-09 00:13:24,684 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-02-09 00:13:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -178829853, now seen corresponding path program 73 times
[2022-02-09 00:13:24,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:24,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620083653]
[2022-02-09 00:13:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:24,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:25,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:25,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620083653]
[2022-02-09 00:13:25,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620083653] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:25,199 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:25,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:13:25,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891615947]
[2022-02-09 00:13:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:25,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:13:25,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:13:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:13:25,202 INFO L87 Difference]: Start difference. First operand 4896 states and 10023 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-02-09 00:13:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:29,376 INFO L93 Difference]: Finished difference Result 8589 states and 17647 transitions.
[2022-02-09 00:13:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:13:29,376 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-02-09 00:13:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:29,389 INFO L225 Difference]: With dead ends: 8589
[2022-02-09 00:13:29,389 INFO L226 Difference]: Without dead ends: 8589
[2022-02-09 00:13:29,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:13:29,390 INFO L933 BasicCegarLoop]: 598 mSDtfsCounter, 1725 mSDsluCounter, 10087 mSDsCounter, 0 mSdLazyCounter, 3715 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 10685 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:29,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1725 Valid, 10685 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3715 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:13:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states.
[2022-02-09 00:13:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 4898.
[2022-02-09 00:13:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4898 states, 4895 states have (on average 2.0484167517875385) internal successors, (10027), 4897 states have internal predecessors, (10027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 10027 transitions.
[2022-02-09 00:13:29,467 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 10027 transitions. Word has length 99
[2022-02-09 00:13:29,467 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:29,467 INFO L470 AbstractCegarLoop]: Abstraction has 4898 states and 10027 transitions.
[2022-02-09 00:13:29,467 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-02-09 00:13:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 10027 transitions.
[2022-02-09 00:13:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:29,473 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:29,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:29,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99
[2022-02-09 00:13:29,474 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-02-09 00:13:29,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1028339571, now seen corresponding path program 74 times
[2022-02-09 00:13:29,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:29,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503996630]
[2022-02-09 00:13:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:29,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:30,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-02-09 00:13:30,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:30,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503996630]
[2022-02-09 00:13:30,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503996630] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:30,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:30,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:13:30,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077145781]
[2022-02-09 00:13:30,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:30,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:13:30,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:13:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:13:30,298 INFO L87 Difference]: Start difference. First operand 4898 states and 10027 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-02-09 00:13:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:35,674 INFO L93 Difference]: Finished difference Result 6631 states and 13605 transitions.
[2022-02-09 00:13:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:13:35,674 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-02-09 00:13:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:35,685 INFO L225 Difference]: With dead ends: 6631
[2022-02-09 00:13:35,685 INFO L226 Difference]: Without dead ends: 6631
[2022-02-09 00:13:35,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:13:35,686 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1577 mSDsluCounter, 10337 mSDsCounter, 0 mSdLazyCounter, 4034 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 10903 SdHoareTripleChecker+Invalid, 4074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:35,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1577 Valid, 10903 Invalid, 4074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4034 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-02-09 00:13:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6631 states.
[2022-02-09 00:13:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6631 to 4880.
[2022-02-09 00:13:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4877 states have (on average 2.048185359852368) internal successors, (9989), 4879 states have internal predecessors, (9989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 9989 transitions.
[2022-02-09 00:13:35,781 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 9989 transitions. Word has length 99
[2022-02-09 00:13:35,781 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:35,781 INFO L470 AbstractCegarLoop]: Abstraction has 4880 states and 9989 transitions.
[2022-02-09 00:13:35,781 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-02-09 00:13:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 9989 transitions.
[2022-02-09 00:13:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:35,786 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:35,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:35,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100
[2022-02-09 00:13:35,786 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-02-09 00:13:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash -966883357, now seen corresponding path program 75 times
[2022-02-09 00:13:35,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:35,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274724381]
[2022-02-09 00:13:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:35,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:36,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:36,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274724381]
[2022-02-09 00:13:36,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274724381] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:36,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:36,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:13:36,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496610027]
[2022-02-09 00:13:36,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:36,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:13:36,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:13:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:13:36,473 INFO L87 Difference]: Start difference. First operand 4880 states and 9989 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-02-09 00:13:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:41,277 INFO L93 Difference]: Finished difference Result 8741 states and 17957 transitions.
[2022-02-09 00:13:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:13:41,278 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-02-09 00:13:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:41,287 INFO L225 Difference]: With dead ends: 8741
[2022-02-09 00:13:41,287 INFO L226 Difference]: Without dead ends: 8741
[2022-02-09 00:13:41,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1180, Invalid=5462, Unknown=0, NotChecked=0, Total=6642
[2022-02-09 00:13:41,288 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 1714 mSDsluCounter, 11419 mSDsCounter, 0 mSdLazyCounter, 4123 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 12041 SdHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:41,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 12041 Invalid, 4160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4123 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:13:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8741 states.
[2022-02-09 00:13:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8741 to 4881.
[2022-02-09 00:13:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4881 states, 4878 states have (on average 2.0481754817548175) internal successors, (9991), 4880 states have internal predecessors, (9991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 9991 transitions.
[2022-02-09 00:13:41,351 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 9991 transitions. Word has length 99
[2022-02-09 00:13:41,351 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:41,351 INFO L470 AbstractCegarLoop]: Abstraction has 4881 states and 9991 transitions.
[2022-02-09 00:13:41,351 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-02-09 00:13:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 9991 transitions.
[2022-02-09 00:13:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:41,355 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:41,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:41,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101
[2022-02-09 00:13:41,355 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-02-09 00:13:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -988076429, now seen corresponding path program 76 times
[2022-02-09 00:13:41,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:41,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989571594]
[2022-02-09 00:13:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:41,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:41,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:41,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989571594]
[2022-02-09 00:13:41,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989571594] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:41,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:41,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:13:41,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262542695]
[2022-02-09 00:13:41,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:41,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:13:41,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:41,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:13:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:13:41,860 INFO L87 Difference]: Start difference. First operand 4881 states and 9991 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-02-09 00:13:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:45,342 INFO L93 Difference]: Finished difference Result 7688 states and 15784 transitions.
[2022-02-09 00:13:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:13:45,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-02-09 00:13:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:45,351 INFO L225 Difference]: With dead ends: 7688
[2022-02-09 00:13:45,352 INFO L226 Difference]: Without dead ends: 7688
[2022-02-09 00:13:45,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1044, Invalid=4962, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:13:45,352 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1843 mSDsluCounter, 10085 mSDsCounter, 0 mSdLazyCounter, 3670 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 10675 SdHoareTripleChecker+Invalid, 3703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:45,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1843 Valid, 10675 Invalid, 3703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3670 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:13:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7688 states.
[2022-02-09 00:13:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7688 to 4883.
[2022-02-09 00:13:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4883 states, 4880 states have (on average 2.048155737704918) internal successors, (9995), 4882 states have internal predecessors, (9995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 9995 transitions.
[2022-02-09 00:13:45,420 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 9995 transitions. Word has length 99
[2022-02-09 00:13:45,420 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:45,420 INFO L470 AbstractCegarLoop]: Abstraction has 4883 states and 9995 transitions.
[2022-02-09 00:13:45,420 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-02-09 00:13:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 9995 transitions.
[2022-02-09 00:13:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:45,424 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:45,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:45,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102
[2022-02-09 00:13:45,424 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-02-09 00:13:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1472913395, now seen corresponding path program 77 times
[2022-02-09 00:13:45,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:45,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756879164]
[2022-02-09 00:13:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:45,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:46,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:46,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756879164]
[2022-02-09 00:13:46,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756879164] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:46,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:46,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:13:46,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524165785]
[2022-02-09 00:13:46,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:46,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:13:46,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:46,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:13:46,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:13:46,027 INFO L87 Difference]: Start difference. First operand 4883 states and 9995 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-02-09 00:13:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:49,390 INFO L93 Difference]: Finished difference Result 6643 states and 13630 transitions.
[2022-02-09 00:13:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:13:49,390 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-02-09 00:13:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:49,399 INFO L225 Difference]: With dead ends: 6643
[2022-02-09 00:13:49,399 INFO L226 Difference]: Without dead ends: 6643
[2022-02-09 00:13:49,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=950, Invalid=4750, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:13:49,400 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1515 mSDsluCounter, 9693 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 10259 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:49,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 10259 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:13:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6643 states.
[2022-02-09 00:13:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6643 to 4872.
[2022-02-09 00:13:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4869 states have (on average 2.048059149722736) internal successors, (9972), 4871 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 9972 transitions.
[2022-02-09 00:13:49,461 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 9972 transitions. Word has length 99
[2022-02-09 00:13:49,461 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:49,461 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 9972 transitions.
[2022-02-09 00:13:49,461 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-02-09 00:13:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 9972 transitions.
[2022-02-09 00:13:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:49,465 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:49,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:13:49,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103
[2022-02-09 00:13:49,465 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-02-09 00:13:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1628672577, now seen corresponding path program 78 times
[2022-02-09 00:13:49,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:49,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265513379]
[2022-02-09 00:13:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:49,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:13:50,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:50,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265513379]
[2022-02-09 00:13:50,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265513379] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:50,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:50,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:13:50,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99055526]
[2022-02-09 00:13:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:50,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:13:50,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:13:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:13:50,231 INFO L87 Difference]: Start difference. First operand 4872 states and 9972 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-02-09 00:13:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:13:56,136 INFO L93 Difference]: Finished difference Result 7027 states and 14376 transitions.
[2022-02-09 00:13:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2022-02-09 00:13:56,137 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-02-09 00:13:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:13:56,146 INFO L225 Difference]: With dead ends: 7027
[2022-02-09 00:13:56,146 INFO L226 Difference]: Without dead ends: 7027
[2022-02-09 00:13:56,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1251, Invalid=5721, Unknown=0, NotChecked=0, Total=6972
[2022-02-09 00:13:56,147 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1976 mSDsluCounter, 10521 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 11111 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:13:56,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1976 Valid, 11111 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3681 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:13:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states.
[2022-02-09 00:13:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 4887.
[2022-02-09 00:13:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4884 states have (on average 2.0479115479115477) internal successors, (10002), 4886 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:13:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10002 transitions.
[2022-02-09 00:13:56,212 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10002 transitions. Word has length 99
[2022-02-09 00:13:56,212 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:13:56,212 INFO L470 AbstractCegarLoop]: Abstraction has 4887 states and 10002 transitions.
[2022-02-09 00:13:56,212 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-02-09 00:13:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10002 transitions.
[2022-02-09 00:13:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:13:56,216 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:13:56,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, 1, 1, 1]
[2022-02-09 00:13:56,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104
[2022-02-09 00:13:56,216 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-02-09 00:13:56,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:13:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1781291341, now seen corresponding path program 79 times
[2022-02-09 00:13:56,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:13:56,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410062979]
[2022-02-09 00:13:56,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:13:56,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:13:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:13:56,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-02-09 00:13:56,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:13:56,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410062979]
[2022-02-09 00:13:56,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410062979] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:13:56,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:13:56,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:13:56,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919824792]
[2022-02-09 00:13:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:13:56,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:13:56,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:13:56,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:13:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:13:56,815 INFO L87 Difference]: Start difference. First operand 4887 states and 10002 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-02-09 00:14:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:00,914 INFO L93 Difference]: Finished difference Result 7452 states and 15275 transitions.
[2022-02-09 00:14:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:14:00,914 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-02-09 00:14:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:00,924 INFO L225 Difference]: With dead ends: 7452
[2022-02-09 00:14:00,924 INFO L226 Difference]: Without dead ends: 7452
[2022-02-09 00:14:00,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1172, Invalid=5470, Unknown=0, NotChecked=0, Total=6642
[2022-02-09 00:14:00,924 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 2070 mSDsluCounter, 10479 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2070 SdHoareTripleChecker+Valid, 11069 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:00,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2070 Valid, 11069 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:14:00,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states.
[2022-02-09 00:14:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 4888.
[2022-02-09 00:14:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4885 states have (on average 2.0479017400204707) internal successors, (10004), 4887 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10004 transitions.
[2022-02-09 00:14:00,991 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10004 transitions. Word has length 99
[2022-02-09 00:14:00,991 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:00,991 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 10004 transitions.
[2022-02-09 00:14:00,992 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-02-09 00:14:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10004 transitions.
[2022-02-09 00:14:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:00,996 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:00,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:00,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105
[2022-02-09 00:14:00,996 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-02-09 00:14:00,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:00,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1760098269, now seen corresponding path program 80 times
[2022-02-09 00:14:00,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:00,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114170535]
[2022-02-09 00:14:00,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:00,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:01,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:01,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114170535]
[2022-02-09 00:14:01,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114170535] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:01,757 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:01,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:14:01,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177335934]
[2022-02-09 00:14:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:01,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:14:01,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:01,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:14:01,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:14:01,758 INFO L87 Difference]: Start difference. First operand 4888 states and 10004 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-02-09 00:14:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:06,038 INFO L93 Difference]: Finished difference Result 7365 states and 15098 transitions.
[2022-02-09 00:14:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:14:06,038 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-02-09 00:14:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:06,047 INFO L225 Difference]: With dead ends: 7365
[2022-02-09 00:14:06,048 INFO L226 Difference]: Without dead ends: 7365
[2022-02-09 00:14:06,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1038, Invalid=4968, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:14:06,048 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1647 mSDsluCounter, 10351 mSDsCounter, 0 mSdLazyCounter, 3807 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 10918 SdHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:06,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1647 Valid, 10918 Invalid, 3845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3807 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:14:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states.
[2022-02-09 00:14:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 4890.
[2022-02-09 00:14:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4887 states have (on average 2.0478821362799264) internal successors, (10008), 4889 states have internal predecessors, (10008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 10008 transitions.
[2022-02-09 00:14:06,106 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 10008 transitions. Word has length 99
[2022-02-09 00:14:06,106 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:06,107 INFO L470 AbstractCegarLoop]: Abstraction has 4890 states and 10008 transitions.
[2022-02-09 00:14:06,107 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-02-09 00:14:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 10008 transitions.
[2022-02-09 00:14:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:06,110 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:06,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:06,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106
[2022-02-09 00:14:06,110 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-02-09 00:14:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:06,111 INFO L85 PathProgramCache]: Analyzing trace with hash -73879203, now seen corresponding path program 81 times
[2022-02-09 00:14:06,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:06,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930199497]
[2022-02-09 00:14:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:06,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:06,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:06,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930199497]
[2022-02-09 00:14:06,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930199497] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:06,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:06,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:14:06,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118692345]
[2022-02-09 00:14:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:06,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:14:06,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:14:06,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:14:06,806 INFO L87 Difference]: Start difference. First operand 4890 states and 10008 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-02-09 00:14:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:10,109 INFO L93 Difference]: Finished difference Result 6320 states and 12944 transitions.
[2022-02-09 00:14:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:14:10,110 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-02-09 00:14:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:10,117 INFO L225 Difference]: With dead ends: 6320
[2022-02-09 00:14:10,117 INFO L226 Difference]: Without dead ends: 6320
[2022-02-09 00:14:10,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=931, Invalid=4619, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:14:10,118 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 1613 mSDsluCounter, 9090 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 9633 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:10,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 9633 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-09 00:14:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6320 states.
[2022-02-09 00:14:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6320 to 4887.
[2022-02-09 00:14:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4884 states have (on average 2.0479115479115477) internal successors, (10002), 4886 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10002 transitions.
[2022-02-09 00:14:10,174 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10002 transitions. Word has length 99
[2022-02-09 00:14:10,174 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:10,174 INFO L470 AbstractCegarLoop]: Abstraction has 4887 states and 10002 transitions.
[2022-02-09 00:14:10,174 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-02-09 00:14:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10002 transitions.
[2022-02-09 00:14:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:10,178 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:10,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:10,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107
[2022-02-09 00:14:10,178 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-02-09 00:14:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1594576337, now seen corresponding path program 82 times
[2022-02-09 00:14:10,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:10,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492866159]
[2022-02-09 00:14:10,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:10,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:10,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:10,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492866159]
[2022-02-09 00:14:10,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492866159] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:10,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:10,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:14:10,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595243935]
[2022-02-09 00:14:10,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:10,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:14:10,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:10,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:14:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:14:10,944 INFO L87 Difference]: Start difference. First operand 4887 states and 10002 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-02-09 00:14:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:15,967 INFO L93 Difference]: Finished difference Result 6916 states and 14212 transitions.
[2022-02-09 00:14:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:14:15,968 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-02-09 00:14:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:15,978 INFO L225 Difference]: With dead ends: 6916
[2022-02-09 00:14:15,979 INFO L226 Difference]: Without dead ends: 6916
[2022-02-09 00:14:15,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:14:15,979 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1461 mSDsluCounter, 9893 mSDsCounter, 0 mSdLazyCounter, 3850 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 10450 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:15,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1461 Valid, 10450 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3850 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:14:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states.
[2022-02-09 00:14:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 4912.
[2022-02-09 00:14:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4912 states, 4909 states have (on average 2.048278671827256) internal successors, (10055), 4911 states have internal predecessors, (10055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10055 transitions.
[2022-02-09 00:14:16,053 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10055 transitions. Word has length 99
[2022-02-09 00:14:16,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:16,053 INFO L470 AbstractCegarLoop]: Abstraction has 4912 states and 10055 transitions.
[2022-02-09 00:14:16,053 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-02-09 00:14:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10055 transitions.
[2022-02-09 00:14:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:16,058 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:16,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:16,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108
[2022-02-09 00:14:16,058 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-02-09 00:14:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1687219849, now seen corresponding path program 83 times
[2022-02-09 00:14:16,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:16,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599975393]
[2022-02-09 00:14:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:16,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:17,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:17,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599975393]
[2022-02-09 00:14:17,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599975393] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:17,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:17,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:14:17,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22453626]
[2022-02-09 00:14:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:17,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:14:17,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:14:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:14:17,044 INFO L87 Difference]: Start difference. First operand 4912 states and 10055 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-02-09 00:14:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:22,756 INFO L93 Difference]: Finished difference Result 8975 states and 18458 transitions.
[2022-02-09 00:14:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:14:22,756 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-02-09 00:14:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:22,767 INFO L225 Difference]: With dead ends: 8975
[2022-02-09 00:14:22,767 INFO L226 Difference]: Without dead ends: 8975
[2022-02-09 00:14:22,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:14:22,768 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 1597 mSDsluCounter, 10975 mSDsCounter, 0 mSdLazyCounter, 4097 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 11578 SdHoareTripleChecker+Invalid, 4136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:22,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1597 Valid, 11578 Invalid, 4136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4097 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-02-09 00:14:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states.
[2022-02-09 00:14:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 4914.
[2022-02-09 00:14:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4911 states have (on average 2.04825901038485) internal successors, (10059), 4913 states have internal predecessors, (10059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 10059 transitions.
[2022-02-09 00:14:22,844 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 10059 transitions. Word has length 99
[2022-02-09 00:14:22,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:22,845 INFO L470 AbstractCegarLoop]: Abstraction has 4914 states and 10059 transitions.
[2022-02-09 00:14:22,845 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-02-09 00:14:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 10059 transitions.
[2022-02-09 00:14:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:22,849 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:22,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:22,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109
[2022-02-09 00:14:22,849 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-02-09 00:14:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -480050425, now seen corresponding path program 84 times
[2022-02-09 00:14:22,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:22,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673595372]
[2022-02-09 00:14:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:22,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:23,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:23,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673595372]
[2022-02-09 00:14:23,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673595372] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:23,707 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:23,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:14:23,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031888034]
[2022-02-09 00:14:23,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:23,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:14:23,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:14:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:14:23,708 INFO L87 Difference]: Start difference. First operand 4914 states and 10059 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-02-09 00:14:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:28,991 INFO L93 Difference]: Finished difference Result 7017 states and 14416 transitions.
[2022-02-09 00:14:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:14:28,992 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-02-09 00:14:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:29,002 INFO L225 Difference]: With dead ends: 7017
[2022-02-09 00:14:29,002 INFO L226 Difference]: Without dead ends: 7017
[2022-02-09 00:14:29,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=939, Invalid=4611, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:14:29,003 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1520 mSDsluCounter, 10427 mSDsCounter, 0 mSdLazyCounter, 4123 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 10998 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:29,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1520 Valid, 10998 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4123 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-02-09 00:14:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states.
[2022-02-09 00:14:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 4896.
[2022-02-09 00:14:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4893 states have (on average 2.0480277948089105) internal successors, (10021), 4895 states have internal predecessors, (10021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10021 transitions.
[2022-02-09 00:14:29,065 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10021 transitions. Word has length 99
[2022-02-09 00:14:29,065 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:29,066 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 10021 transitions.
[2022-02-09 00:14:29,066 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-02-09 00:14:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10021 transitions.
[2022-02-09 00:14:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:29,070 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:29,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:29,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110
[2022-02-09 00:14:29,070 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-02-09 00:14:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1819693943, now seen corresponding path program 85 times
[2022-02-09 00:14:29,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:29,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243820106]
[2022-02-09 00:14:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:29,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:29,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:29,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243820106]
[2022-02-09 00:14:29,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243820106] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:29,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:29,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:14:29,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023093327]
[2022-02-09 00:14:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:29,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:14:29,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:14:29,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:14:29,845 INFO L87 Difference]: Start difference. First operand 4896 states and 10021 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-02-09 00:14:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:35,572 INFO L93 Difference]: Finished difference Result 9008 states and 18510 transitions.
[2022-02-09 00:14:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:14:35,573 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-02-09 00:14:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:35,586 INFO L225 Difference]: With dead ends: 9008
[2022-02-09 00:14:35,586 INFO L226 Difference]: Without dead ends: 9008
[2022-02-09 00:14:35,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1165, Invalid=5315, Unknown=0, NotChecked=0, Total=6480
[2022-02-09 00:14:35,587 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 1776 mSDsluCounter, 10957 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 11584 SdHoareTripleChecker+Invalid, 3890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:35,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1776 Valid, 11584 Invalid, 3890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:14:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9008 states.
[2022-02-09 00:14:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9008 to 4897.
[2022-02-09 00:14:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4897 states, 4894 states have (on average 2.0480179812014714) internal successors, (10023), 4896 states have internal predecessors, (10023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 10023 transitions.
[2022-02-09 00:14:35,694 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 10023 transitions. Word has length 99
[2022-02-09 00:14:35,694 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:35,694 INFO L470 AbstractCegarLoop]: Abstraction has 4897 states and 10023 transitions.
[2022-02-09 00:14:35,694 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-02-09 00:14:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 10023 transitions.
[2022-02-09 00:14:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:35,698 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:35,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:35,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111
[2022-02-09 00:14:35,699 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-02-09 00:14:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1798500871, now seen corresponding path program 86 times
[2022-02-09 00:14:35,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:35,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052888471]
[2022-02-09 00:14:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:35,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:36,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:36,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052888471]
[2022-02-09 00:14:36,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052888471] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:36,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:36,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:14:36,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845444408]
[2022-02-09 00:14:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:36,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:14:36,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:14:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:14:36,584 INFO L87 Difference]: Start difference. First operand 4897 states and 10023 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-02-09 00:14:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:42,071 INFO L93 Difference]: Finished difference Result 8031 states and 16489 transitions.
[2022-02-09 00:14:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:14:42,071 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-02-09 00:14:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:42,082 INFO L225 Difference]: With dead ends: 8031
[2022-02-09 00:14:42,082 INFO L226 Difference]: Without dead ends: 8031
[2022-02-09 00:14:42,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1059, Invalid=5103, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:14:42,083 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 1739 mSDsluCounter, 10211 mSDsCounter, 0 mSdLazyCounter, 3737 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 10806 SdHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:42,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1739 Valid, 10806 Invalid, 3778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3737 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:14:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8031 states.
[2022-02-09 00:14:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8031 to 4899.
[2022-02-09 00:14:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4899 states, 4896 states have (on average 2.047998366013072) internal successors, (10027), 4898 states have internal predecessors, (10027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 10027 transitions.
[2022-02-09 00:14:42,158 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 10027 transitions. Word has length 99
[2022-02-09 00:14:42,159 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:42,159 INFO L470 AbstractCegarLoop]: Abstraction has 4899 states and 10027 transitions.
[2022-02-09 00:14:42,159 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-02-09 00:14:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 10027 transitions.
[2022-02-09 00:14:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:42,163 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:42,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:42,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112
[2022-02-09 00:14:42,163 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-02-09 00:14:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash -35476601, now seen corresponding path program 87 times
[2022-02-09 00:14:42,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:42,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076714831]
[2022-02-09 00:14:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:42,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:42,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:42,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076714831]
[2022-02-09 00:14:42,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076714831] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:42,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:42,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:14:42,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192915747]
[2022-02-09 00:14:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:42,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:14:42,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:42,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:14:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:14:42,975 INFO L87 Difference]: Start difference. First operand 4899 states and 10027 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-02-09 00:14:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:47,911 INFO L93 Difference]: Finished difference Result 6986 states and 14335 transitions.
[2022-02-09 00:14:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:14:47,911 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-02-09 00:14:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:47,920 INFO L225 Difference]: With dead ends: 6986
[2022-02-09 00:14:47,921 INFO L226 Difference]: Without dead ends: 6986
[2022-02-09 00:14:47,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=950, Invalid=4750, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:14:47,921 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1451 mSDsluCounter, 10058 mSDsCounter, 0 mSdLazyCounter, 3766 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 10629 SdHoareTripleChecker+Invalid, 3803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:47,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1451 Valid, 10629 Invalid, 3803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3766 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:14:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states.
[2022-02-09 00:14:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 4888.
[2022-02-09 00:14:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4885 states have (on average 2.0479017400204707) internal successors, (10004), 4887 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10004 transitions.
[2022-02-09 00:14:47,990 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10004 transitions. Word has length 99
[2022-02-09 00:14:47,990 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:47,990 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 10004 transitions.
[2022-02-09 00:14:47,990 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-02-09 00:14:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10004 transitions.
[2022-02-09 00:14:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:47,994 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:47,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:47,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113
[2022-02-09 00:14:47,994 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-02-09 00:14:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash -67592007, now seen corresponding path program 88 times
[2022-02-09 00:14:47,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:47,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210126709]
[2022-02-09 00:14:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:47,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:48,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:48,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210126709]
[2022-02-09 00:14:48,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210126709] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:48,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:48,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:14:48,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738019420]
[2022-02-09 00:14:48,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:48,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:14:48,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:14:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:14:48,818 INFO L87 Difference]: Start difference. First operand 4888 states and 10004 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-02-09 00:14:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:53,730 INFO L93 Difference]: Finished difference Result 6889 states and 14155 transitions.
[2022-02-09 00:14:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:14:53,731 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-02-09 00:14:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:53,741 INFO L225 Difference]: With dead ends: 6889
[2022-02-09 00:14:53,741 INFO L226 Difference]: Without dead ends: 6889
[2022-02-09 00:14:53,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:14:53,742 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1469 mSDsluCounter, 9520 mSDsCounter, 0 mSdLazyCounter, 3704 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 10076 SdHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:53,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 10076 Invalid, 3736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3704 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:14:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6889 states.
[2022-02-09 00:14:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6889 to 4906.
[2022-02-09 00:14:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4903 states have (on average 2.048133795635325) internal successors, (10042), 4905 states have internal predecessors, (10042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:14:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 10042 transitions.
[2022-02-09 00:14:53,817 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 10042 transitions. Word has length 99
[2022-02-09 00:14:53,817 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:14:53,817 INFO L470 AbstractCegarLoop]: Abstraction has 4906 states and 10042 transitions.
[2022-02-09 00:14:53,817 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-02-09 00:14:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 10042 transitions.
[2022-02-09 00:14:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:14:53,821 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:14:53,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:14:53,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114
[2022-02-09 00:14:53,821 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-02-09 00:14:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:14:53,822 INFO L85 PathProgramCache]: Analyzing trace with hash -160235519, now seen corresponding path program 89 times
[2022-02-09 00:14:53,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:14:53,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174915436]
[2022-02-09 00:14:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:14:53,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:14:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:14:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:14:54,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:14:54,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174915436]
[2022-02-09 00:14:54,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174915436] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:14:54,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:14:54,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:14:54,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721832677]
[2022-02-09 00:14:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:14:54,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:14:54,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:14:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:14:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:14:54,603 INFO L87 Difference]: Start difference. First operand 4906 states and 10042 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-02-09 00:14:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:14:59,966 INFO L93 Difference]: Finished difference Result 8836 states and 18158 transitions.
[2022-02-09 00:14:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:14:59,966 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-02-09 00:14:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:14:59,979 INFO L225 Difference]: With dead ends: 8836
[2022-02-09 00:14:59,979 INFO L226 Difference]: Without dead ends: 8836
[2022-02-09 00:14:59,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:14:59,980 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 1704 mSDsluCounter, 10848 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 11450 SdHoareTripleChecker+Invalid, 4101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:14:59,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1704 Valid, 11450 Invalid, 4101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4058 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-09 00:14:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8836 states.
[2022-02-09 00:15:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8836 to 4908.
[2022-02-09 00:15:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 4905 states have (on average 2.048114169215087) internal successors, (10046), 4907 states have internal predecessors, (10046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 10046 transitions.
[2022-02-09 00:15:00,058 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 10046 transitions. Word has length 99
[2022-02-09 00:15:00,059 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:00,059 INFO L470 AbstractCegarLoop]: Abstraction has 4908 states and 10046 transitions.
[2022-02-09 00:15:00,059 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-02-09 00:15:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 10046 transitions.
[2022-02-09 00:15:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:00,064 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:00,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:00,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115
[2022-02-09 00:15:00,064 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-02-09 00:15:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1046933905, now seen corresponding path program 90 times
[2022-02-09 00:15:00,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:00,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335324006]
[2022-02-09 00:15:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:00,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:00,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:00,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335324006]
[2022-02-09 00:15:00,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335324006] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:00,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:00,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:15:00,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468575486]
[2022-02-09 00:15:00,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:00,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:15:00,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:15:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:15:00,951 INFO L87 Difference]: Start difference. First operand 4908 states and 10046 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-02-09 00:15:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:06,051 INFO L93 Difference]: Finished difference Result 6946 states and 14252 transitions.
[2022-02-09 00:15:06,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:15:06,051 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-02-09 00:15:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:06,060 INFO L225 Difference]: With dead ends: 6946
[2022-02-09 00:15:06,060 INFO L226 Difference]: Without dead ends: 6946
[2022-02-09 00:15:06,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:15:06,061 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1554 mSDsluCounter, 9745 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 10315 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:06,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1554 Valid, 10315 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:15:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states.
[2022-02-09 00:15:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 4890.
[2022-02-09 00:15:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4887 states have (on average 2.0478821362799264) internal successors, (10008), 4889 states have internal predecessors, (10008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 10008 transitions.
[2022-02-09 00:15:06,121 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 10008 transitions. Word has length 99
[2022-02-09 00:15:06,121 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:06,121 INFO L470 AbstractCegarLoop]: Abstraction has 4890 states and 10008 transitions.
[2022-02-09 00:15:06,121 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-02-09 00:15:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 10008 transitions.
[2022-02-09 00:15:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:06,125 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:06,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:06,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116
[2022-02-09 00:15:06,125 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-02-09 00:15:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1638182441, now seen corresponding path program 91 times
[2022-02-09 00:15:06,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:06,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104921547]
[2022-02-09 00:15:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:06,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:07,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:07,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104921547]
[2022-02-09 00:15:07,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104921547] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:07,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:07,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:15:07,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521456901]
[2022-02-09 00:15:07,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:07,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:15:07,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:07,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:15:07,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:15:07,043 INFO L87 Difference]: Start difference. First operand 4890 states and 10008 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-02-09 00:15:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:12,209 INFO L93 Difference]: Finished difference Result 6633 states and 13607 transitions.
[2022-02-09 00:15:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:15:12,209 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-02-09 00:15:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:12,218 INFO L225 Difference]: With dead ends: 6633
[2022-02-09 00:15:12,219 INFO L226 Difference]: Without dead ends: 6633
[2022-02-09 00:15:12,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:15:12,219 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 1514 mSDsluCounter, 9757 mSDsCounter, 0 mSdLazyCounter, 3847 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 10311 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:12,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 10311 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3847 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-09 00:15:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6633 states.
[2022-02-09 00:15:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6633 to 4887.
[2022-02-09 00:15:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4884 states have (on average 2.0479115479115477) internal successors, (10002), 4886 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10002 transitions.
[2022-02-09 00:15:12,287 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10002 transitions. Word has length 99
[2022-02-09 00:15:12,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:12,287 INFO L470 AbstractCegarLoop]: Abstraction has 4887 states and 10002 transitions.
[2022-02-09 00:15:12,287 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-02-09 00:15:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10002 transitions.
[2022-02-09 00:15:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:12,292 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:12,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:12,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117
[2022-02-09 00:15:12,292 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-02-09 00:15:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1568360313, now seen corresponding path program 92 times
[2022-02-09 00:15:12,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:12,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486277852]
[2022-02-09 00:15:12,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:12,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:13,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:13,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486277852]
[2022-02-09 00:15:13,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486277852] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:13,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:13,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:15:13,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026439516]
[2022-02-09 00:15:13,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:13,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:15:13,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:13,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:15:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:15:13,158 INFO L87 Difference]: Start difference. First operand 4887 states and 10002 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-02-09 00:15:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:18,282 INFO L93 Difference]: Finished difference Result 6976 states and 14332 transitions.
[2022-02-09 00:15:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:15:18,282 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-02-09 00:15:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:18,293 INFO L225 Difference]: With dead ends: 6976
[2022-02-09 00:15:18,294 INFO L226 Difference]: Without dead ends: 6976
[2022-02-09 00:15:18,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:15:18,296 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1653 mSDsluCounter, 9557 mSDsCounter, 0 mSdLazyCounter, 3760 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 10114 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.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:18,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1653 Valid, 10114 Invalid, 3795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3760 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:15:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6976 states.
[2022-02-09 00:15:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6976 to 4914.
[2022-02-09 00:15:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4911 states have (on average 2.04825901038485) internal successors, (10059), 4913 states have internal predecessors, (10059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 10059 transitions.
[2022-02-09 00:15:18,370 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 10059 transitions. Word has length 99
[2022-02-09 00:15:18,370 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:18,370 INFO L470 AbstractCegarLoop]: Abstraction has 4914 states and 10059 transitions.
[2022-02-09 00:15:18,370 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-02-09 00:15:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 10059 transitions.
[2022-02-09 00:15:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:18,375 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:18,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-02-09 00:15:18,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118
[2022-02-09 00:15:18,375 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-02-09 00:15:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1661003825, now seen corresponding path program 93 times
[2022-02-09 00:15:18,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:18,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075925754]
[2022-02-09 00:15:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:18,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:19,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:19,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075925754]
[2022-02-09 00:15:19,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075925754] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:19,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:19,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:15:19,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428982292]
[2022-02-09 00:15:19,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:19,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:15:19,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:15:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:15:19,168 INFO L87 Difference]: Start difference. First operand 4914 states and 10059 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-02-09 00:15:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:24,960 INFO L93 Difference]: Finished difference Result 9035 states and 18578 transitions.
[2022-02-09 00:15:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:15:24,960 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-02-09 00:15:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:24,974 INFO L225 Difference]: With dead ends: 9035
[2022-02-09 00:15:24,974 INFO L226 Difference]: Without dead ends: 9035
[2022-02-09 00:15:24,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:15:24,976 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 1607 mSDsluCounter, 11052 mSDsCounter, 0 mSdLazyCounter, 4258 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 11655 SdHoareTripleChecker+Invalid, 4297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:24,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1607 Valid, 11655 Invalid, 4297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4258 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-02-09 00:15:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states.
[2022-02-09 00:15:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 4916.
[2022-02-09 00:15:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4916 states, 4913 states have (on average 2.0482393649501325) internal successors, (10063), 4915 states have internal predecessors, (10063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 10063 transitions.
[2022-02-09 00:15:25,070 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 10063 transitions. Word has length 99
[2022-02-09 00:15:25,070 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:25,070 INFO L470 AbstractCegarLoop]: Abstraction has 4916 states and 10063 transitions.
[2022-02-09 00:15:25,070 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-02-09 00:15:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 10063 transitions.
[2022-02-09 00:15:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:25,074 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:25,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:25,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119
[2022-02-09 00:15:25,074 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-02-09 00:15:25,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -453834401, now seen corresponding path program 94 times
[2022-02-09 00:15:25,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:25,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078362630]
[2022-02-09 00:15:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:25,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:25,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:25,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078362630]
[2022-02-09 00:15:25,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078362630] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:25,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:25,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:15:25,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834631961]
[2022-02-09 00:15:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:25,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:15:25,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:25,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:15:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:15:25,970 INFO L87 Difference]: Start difference. First operand 4916 states and 10063 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-02-09 00:15:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:31,163 INFO L93 Difference]: Finished difference Result 7077 states and 14536 transitions.
[2022-02-09 00:15:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:15:31,164 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-02-09 00:15:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:31,176 INFO L225 Difference]: With dead ends: 7077
[2022-02-09 00:15:31,176 INFO L226 Difference]: Without dead ends: 7077
[2022-02-09 00:15:31,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:15:31,177 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1617 mSDsluCounter, 9341 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 9912 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:31,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1617 Valid, 9912 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:15:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states.
[2022-02-09 00:15:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 4898.
[2022-02-09 00:15:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4898 states, 4895 states have (on average 2.0480081716036773) internal successors, (10025), 4897 states have internal predecessors, (10025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 10025 transitions.
[2022-02-09 00:15:31,286 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 10025 transitions. Word has length 99
[2022-02-09 00:15:31,286 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:31,286 INFO L470 AbstractCegarLoop]: Abstraction has 4898 states and 10025 transitions.
[2022-02-09 00:15:31,286 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-02-09 00:15:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 10025 transitions.
[2022-02-09 00:15:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:31,291 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:31,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:31,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120
[2022-02-09 00:15:31,292 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:15:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1845909967, now seen corresponding path program 95 times
[2022-02-09 00:15:31,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:31,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937179464]
[2022-02-09 00:15:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:31,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:32,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:32,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937179464]
[2022-02-09 00:15:32,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937179464] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:32,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:32,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:15:32,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25700058]
[2022-02-09 00:15:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:32,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:15:32,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:15:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:15:32,012 INFO L87 Difference]: Start difference. First operand 4898 states and 10025 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-02-09 00:15:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:37,304 INFO L93 Difference]: Finished difference Result 9068 states and 18630 transitions.
[2022-02-09 00:15:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:15:37,304 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-02-09 00:15:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:37,316 INFO L225 Difference]: With dead ends: 9068
[2022-02-09 00:15:37,316 INFO L226 Difference]: Without dead ends: 9068
[2022-02-09 00:15:37,317 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-02-09 00:15:37,317 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 1654 mSDsluCounter, 11061 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 11688 SdHoareTripleChecker+Invalid, 3989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:37,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1654 Valid, 11688 Invalid, 3989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3954 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:15:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9068 states.
[2022-02-09 00:15:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9068 to 4899.
[2022-02-09 00:15:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4899 states, 4896 states have (on average 2.047998366013072) internal successors, (10027), 4898 states have internal predecessors, (10027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 10027 transitions.
[2022-02-09 00:15:37,395 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 10027 transitions. Word has length 99
[2022-02-09 00:15:37,395 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:37,395 INFO L470 AbstractCegarLoop]: Abstraction has 4899 states and 10027 transitions.
[2022-02-09 00:15:37,395 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-02-09 00:15:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 10027 transitions.
[2022-02-09 00:15:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:37,399 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:37,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:37,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121
[2022-02-09 00:15:37,400 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:15:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1824716895, now seen corresponding path program 96 times
[2022-02-09 00:15:37,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:37,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341149789]
[2022-02-09 00:15:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:37,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:38,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:38,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341149789]
[2022-02-09 00:15:38,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341149789] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:38,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:38,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:15:38,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255002245]
[2022-02-09 00:15:38,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:38,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:15:38,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:38,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:15:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:15:38,050 INFO L87 Difference]: Start difference. First operand 4899 states and 10027 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-02-09 00:15:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:41,996 INFO L93 Difference]: Finished difference Result 8091 states and 16609 transitions.
[2022-02-09 00:15:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:15:41,996 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-02-09 00:15:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:42,011 INFO L225 Difference]: With dead ends: 8091
[2022-02-09 00:15:42,011 INFO L226 Difference]: Without dead ends: 8091
[2022-02-09 00:15:42,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1059, Invalid=5103, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:15:42,012 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 1610 mSDsluCounter, 11067 mSDsCounter, 0 mSdLazyCounter, 4060 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 11662 SdHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:42,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1610 Valid, 11662 Invalid, 4098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4060 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:15:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states.
[2022-02-09 00:15:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 4901.
[2022-02-09 00:15:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4901 states, 4898 states have (on average 2.0479787668436096) internal successors, (10031), 4900 states have internal predecessors, (10031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 10031 transitions.
[2022-02-09 00:15:42,099 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 10031 transitions. Word has length 99
[2022-02-09 00:15:42,099 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:42,099 INFO L470 AbstractCegarLoop]: Abstraction has 4901 states and 10031 transitions.
[2022-02-09 00:15:42,100 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-02-09 00:15:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 10031 transitions.
[2022-02-09 00:15:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:42,104 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:42,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:42,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122
[2022-02-09 00:15:42,105 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:15:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash -9260577, now seen corresponding path program 97 times
[2022-02-09 00:15:42,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:42,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828701724]
[2022-02-09 00:15:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:42,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:42,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:42,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828701724]
[2022-02-09 00:15:42,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828701724] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:42,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:42,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:15:42,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294147977]
[2022-02-09 00:15:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:42,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:15:42,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:15:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:15:42,667 INFO L87 Difference]: Start difference. First operand 4901 states and 10031 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-02-09 00:15:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:45,857 INFO L93 Difference]: Finished difference Result 7046 states and 14455 transitions.
[2022-02-09 00:15:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:15:45,858 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-02-09 00:15:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:45,868 INFO L225 Difference]: With dead ends: 7046
[2022-02-09 00:15:45,868 INFO L226 Difference]: Without dead ends: 7046
[2022-02-09 00:15:45,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=950, Invalid=4750, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:15:45,869 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1643 mSDsluCounter, 9377 mSDsCounter, 0 mSdLazyCounter, 3529 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 9948 SdHoareTripleChecker+Invalid, 3572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:45,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 9948 Invalid, 3572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3529 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:15:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states.
[2022-02-09 00:15:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 4890.
[2022-02-09 00:15:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4887 states have (on average 2.0478821362799264) internal successors, (10008), 4889 states have internal predecessors, (10008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 10008 transitions.
[2022-02-09 00:15:45,939 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 10008 transitions. Word has length 99
[2022-02-09 00:15:45,939 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:45,939 INFO L470 AbstractCegarLoop]: Abstraction has 4890 states and 10008 transitions.
[2022-02-09 00:15:45,939 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-02-09 00:15:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 10008 transitions.
[2022-02-09 00:15:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:45,944 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:45,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:45,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123
[2022-02-09 00:15:45,944 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:15:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -41375983, now seen corresponding path program 98 times
[2022-02-09 00:15:45,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:45,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242405239]
[2022-02-09 00:15:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:45,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:46,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:46,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242405239]
[2022-02-09 00:15:46,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242405239] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:46,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:46,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:15:46,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751771065]
[2022-02-09 00:15:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:46,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:15:46,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:15:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:15:46,769 INFO L87 Difference]: Start difference. First operand 4890 states and 10008 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-02-09 00:15:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:51,230 INFO L93 Difference]: Finished difference Result 7975 states and 16410 transitions.
[2022-02-09 00:15:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:15:51,231 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-02-09 00:15:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:51,243 INFO L225 Difference]: With dead ends: 7975
[2022-02-09 00:15:51,244 INFO L226 Difference]: Without dead ends: 7975
[2022-02-09 00:15:51,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1133, Invalid=5673, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:15:51,244 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1913 mSDsluCounter, 9845 mSDsCounter, 0 mSdLazyCounter, 4119 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1913 SdHoareTripleChecker+Valid, 10411 SdHoareTripleChecker+Invalid, 4165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:51,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1913 Valid, 10411 Invalid, 4165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4119 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:15:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states.
[2022-02-09 00:15:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 5201.
[2022-02-09 00:15:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5198 states have (on average 2.0555983070411696) internal successors, (10685), 5200 states have internal predecessors, (10685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 10685 transitions.
[2022-02-09 00:15:51,356 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 10685 transitions. Word has length 99
[2022-02-09 00:15:51,356 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:51,356 INFO L470 AbstractCegarLoop]: Abstraction has 5201 states and 10685 transitions.
[2022-02-09 00:15:51,356 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-02-09 00:15:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 10685 transitions.
[2022-02-09 00:15:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:51,361 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:51,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:51,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124
[2022-02-09 00:15:51,361 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:15:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1060689997, now seen corresponding path program 99 times
[2022-02-09 00:15:51,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:51,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939021712]
[2022-02-09 00:15:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:51,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:15:52,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:52,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939021712]
[2022-02-09 00:15:52,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939021712] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:52,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:52,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:15:52,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972647055]
[2022-02-09 00:15:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:52,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:15:52,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:52,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:15:52,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1238, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:15:52,346 INFO L87 Difference]: Start difference. First operand 5201 states and 10685 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-02-09 00:15:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:15:57,057 INFO L93 Difference]: Finished difference Result 10215 states and 21054 transitions.
[2022-02-09 00:15:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:15:57,057 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-02-09 00:15:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:15:57,071 INFO L225 Difference]: With dead ends: 10215
[2022-02-09 00:15:57,071 INFO L226 Difference]: Without dead ends: 10215
[2022-02-09 00:15:57,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1413, Invalid=7143, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:15:57,073 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1942 mSDsluCounter, 10571 mSDsCounter, 0 mSdLazyCounter, 4427 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 11141 SdHoareTripleChecker+Invalid, 4481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:15:57,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1942 Valid, 11141 Invalid, 4481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4427 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:15:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states.
[2022-02-09 00:15:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 5098.
[2022-02-09 00:15:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5098 states, 5095 states have (on average 2.0506378802747793) internal successors, (10448), 5097 states have internal predecessors, (10448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:15:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 10448 transitions.
[2022-02-09 00:15:57,157 INFO L78 Accepts]: Start accepts. Automaton has 5098 states and 10448 transitions. Word has length 99
[2022-02-09 00:15:57,157 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:15:57,157 INFO L470 AbstractCegarLoop]: Abstraction has 5098 states and 10448 transitions.
[2022-02-09 00:15:57,157 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-02-09 00:15:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5098 states and 10448 transitions.
[2022-02-09 00:15:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:15:57,161 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:15:57,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:15:57,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125
[2022-02-09 00:15:57,161 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:15:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:15:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash -432201139, now seen corresponding path program 100 times
[2022-02-09 00:15:57,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:15:57,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962789458]
[2022-02-09 00:15:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:15:57,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:15:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:15:58,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-02-09 00:15:58,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:15:58,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962789458]
[2022-02-09 00:15:58,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962789458] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:15:58,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:15:58,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:15:58,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791498884]
[2022-02-09 00:15:58,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:15:58,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:15:58,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:15:58,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:15:58,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:15:58,109 INFO L87 Difference]: Start difference. First operand 5098 states and 10448 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-02-09 00:16:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:05,499 INFO L93 Difference]: Finished difference Result 10252 states and 21113 transitions.
[2022-02-09 00:16:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:16:05,499 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-02-09 00:16:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:05,515 INFO L225 Difference]: With dead ends: 10252
[2022-02-09 00:16:05,516 INFO L226 Difference]: Without dead ends: 10252
[2022-02-09 00:16:05,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1409, Invalid=7147, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:16:05,516 INFO L933 BasicCegarLoop]: 724 mSDtfsCounter, 1755 mSDsluCounter, 14005 mSDsCounter, 0 mSdLazyCounter, 5824 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 14729 SdHoareTripleChecker+Invalid, 5878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 5824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:05,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1755 Valid, 14729 Invalid, 5878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 5824 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2022-02-09 00:16:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10252 states.
[2022-02-09 00:16:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10252 to 4948.
[2022-02-09 00:16:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4948 states, 4945 states have (on average 2.0487360970677453) internal successors, (10131), 4947 states have internal predecessors, (10131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 10131 transitions.
[2022-02-09 00:16:05,596 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 10131 transitions. Word has length 99
[2022-02-09 00:16:05,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:05,596 INFO L470 AbstractCegarLoop]: Abstraction has 4948 states and 10131 transitions.
[2022-02-09 00:16:05,596 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-02-09 00:16:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 10131 transitions.
[2022-02-09 00:16:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:05,600 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:05,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:05,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126
[2022-02-09 00:16:05,600 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 851513067, now seen corresponding path program 101 times
[2022-02-09 00:16:05,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:05,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226284020]
[2022-02-09 00:16:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:05,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:06,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:06,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226284020]
[2022-02-09 00:16:06,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226284020] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:06,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:06,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:16:06,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760934027]
[2022-02-09 00:16:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:06,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:16:06,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:06,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:16:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:16:06,367 INFO L87 Difference]: Start difference. First operand 4948 states and 10131 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-02-09 00:16:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:10,416 INFO L93 Difference]: Finished difference Result 8676 states and 17847 transitions.
[2022-02-09 00:16:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:16:10,417 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-02-09 00:16:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:10,429 INFO L225 Difference]: With dead ends: 8676
[2022-02-09 00:16:10,429 INFO L226 Difference]: Without dead ends: 8676
[2022-02-09 00:16:10,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:16:10,431 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1541 mSDsluCounter, 9235 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 9797 SdHoareTripleChecker+Invalid, 3702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:10,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 9797 Invalid, 3702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:16:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8676 states.
[2022-02-09 00:16:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8676 to 4908.
[2022-02-09 00:16:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 4905 states have (on average 2.048114169215087) internal successors, (10046), 4907 states have internal predecessors, (10046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 10046 transitions.
[2022-02-09 00:16:10,504 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 10046 transitions. Word has length 99
[2022-02-09 00:16:10,504 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:10,504 INFO L470 AbstractCegarLoop]: Abstraction has 4908 states and 10046 transitions.
[2022-02-09 00:16:10,504 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-02-09 00:16:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 10046 transitions.
[2022-02-09 00:16:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:10,508 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:10,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:10,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127
[2022-02-09 00:16:10,510 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash -134019495, now seen corresponding path program 102 times
[2022-02-09 00:16:10,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:10,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668987335]
[2022-02-09 00:16:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:10,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:11,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:11,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668987335]
[2022-02-09 00:16:11,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668987335] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:11,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:11,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:16:11,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847265792]
[2022-02-09 00:16:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:11,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:16:11,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:11,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:16:11,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:16:11,264 INFO L87 Difference]: Start difference. First operand 4908 states and 10046 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-02-09 00:16:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:16,745 INFO L93 Difference]: Finished difference Result 9266 states and 19057 transitions.
[2022-02-09 00:16:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:16:16,745 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-02-09 00:16:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:16,760 INFO L225 Difference]: With dead ends: 9266
[2022-02-09 00:16:16,760 INFO L226 Difference]: Without dead ends: 9266
[2022-02-09 00:16:16,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:16:16,762 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 1644 mSDsluCounter, 11404 mSDsCounter, 0 mSdLazyCounter, 4390 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 12012 SdHoareTripleChecker+Invalid, 4428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:16,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1644 Valid, 12012 Invalid, 4428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4390 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-02-09 00:16:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9266 states.
[2022-02-09 00:16:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9266 to 4910.
[2022-02-09 00:16:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 4907 states have (on average 2.04809455879356) internal successors, (10050), 4909 states have internal predecessors, (10050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 10050 transitions.
[2022-02-09 00:16:16,856 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 10050 transitions. Word has length 99
[2022-02-09 00:16:16,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:16,856 INFO L470 AbstractCegarLoop]: Abstraction has 4910 states and 10050 transitions.
[2022-02-09 00:16:16,856 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-02-09 00:16:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 10050 transitions.
[2022-02-09 00:16:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:16,860 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:16,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:16,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128
[2022-02-09 00:16:16,861 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1073149929, now seen corresponding path program 103 times
[2022-02-09 00:16:16,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:16,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447287454]
[2022-02-09 00:16:16,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:16,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:17,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:17,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447287454]
[2022-02-09 00:16:17,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447287454] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:17,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:17,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:16:17,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005940492]
[2022-02-09 00:16:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:17,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:16:17,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:16:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:16:17,678 INFO L87 Difference]: Start difference. First operand 4910 states and 10050 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-02-09 00:16:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:22,703 INFO L93 Difference]: Finished difference Result 7376 states and 15151 transitions.
[2022-02-09 00:16:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:16:22,703 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-02-09 00:16:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:22,716 INFO L225 Difference]: With dead ends: 7376
[2022-02-09 00:16:22,717 INFO L226 Difference]: Without dead ends: 7376
[2022-02-09 00:16:22,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:16:22,718 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1648 mSDsluCounter, 10101 mSDsCounter, 0 mSdLazyCounter, 4001 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 10677 SdHoareTripleChecker+Invalid, 4043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:22,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1648 Valid, 10677 Invalid, 4043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4001 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-09 00:16:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states.
[2022-02-09 00:16:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 4892.
[2022-02-09 00:16:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4889 states have (on average 2.047862548578441) internal successors, (10012), 4891 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 10012 transitions.
[2022-02-09 00:16:22,830 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 10012 transitions. Word has length 99
[2022-02-09 00:16:22,830 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:22,830 INFO L470 AbstractCegarLoop]: Abstraction has 4892 states and 10012 transitions.
[2022-02-09 00:16:22,830 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-02-09 00:16:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 10012 transitions.
[2022-02-09 00:16:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:22,836 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:22,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:22,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129
[2022-02-09 00:16:22,837 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1611966417, now seen corresponding path program 104 times
[2022-02-09 00:16:22,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:22,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087188595]
[2022-02-09 00:16:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:22,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:23,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:23,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087188595]
[2022-02-09 00:16:23,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087188595] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:23,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:23,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:16:23,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490511748]
[2022-02-09 00:16:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:23,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:16:23,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:23,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:16:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:16:23,759 INFO L87 Difference]: Start difference. First operand 4892 states and 10012 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-02-09 00:16:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:28,620 INFO L93 Difference]: Finished difference Result 7063 states and 14506 transitions.
[2022-02-09 00:16:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:16:28,621 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-02-09 00:16:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:28,631 INFO L225 Difference]: With dead ends: 7063
[2022-02-09 00:16:28,632 INFO L226 Difference]: Without dead ends: 7063
[2022-02-09 00:16:28,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=958, Invalid=4742, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:16:28,632 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1651 mSDsluCounter, 8924 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 9484 SdHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:28,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1651 Valid, 9484 Invalid, 3487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:16:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states.
[2022-02-09 00:16:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 4889.
[2022-02-09 00:16:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4889 states, 4886 states have (on average 2.0478919361440853) internal successors, (10006), 4888 states have internal predecessors, (10006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 10006 transitions.
[2022-02-09 00:16:28,710 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 10006 transitions. Word has length 99
[2022-02-09 00:16:28,710 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:28,710 INFO L470 AbstractCegarLoop]: Abstraction has 4889 states and 10006 transitions.
[2022-02-09 00:16:28,710 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-02-09 00:16:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 10006 transitions.
[2022-02-09 00:16:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:28,714 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:28,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:28,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130
[2022-02-09 00:16:28,715 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash -795570981, now seen corresponding path program 105 times
[2022-02-09 00:16:28,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:28,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228839301]
[2022-02-09 00:16:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:28,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:29,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:29,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228839301]
[2022-02-09 00:16:29,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228839301] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:29,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:29,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:16:29,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607716630]
[2022-02-09 00:16:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:29,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:16:29,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:16:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:16:29,677 INFO L87 Difference]: Start difference. First operand 4889 states and 10006 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-02-09 00:16:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:34,488 INFO L93 Difference]: Finished difference Result 6948 states and 14273 transitions.
[2022-02-09 00:16:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:16:34,488 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-02-09 00:16:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:34,498 INFO L225 Difference]: With dead ends: 6948
[2022-02-09 00:16:34,498 INFO L226 Difference]: Without dead ends: 6948
[2022-02-09 00:16:34,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:16:34,498 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1490 mSDsluCounter, 9137 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 9693 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:34,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 9693 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:16:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states.
[2022-02-09 00:16:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 4911.
[2022-02-09 00:16:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4911 states, 4908 states have (on average 2.048084759576202) internal successors, (10052), 4910 states have internal predecessors, (10052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 10052 transitions.
[2022-02-09 00:16:34,564 INFO L78 Accepts]: Start accepts. Automaton has 4911 states and 10052 transitions. Word has length 99
[2022-02-09 00:16:34,564 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:34,564 INFO L470 AbstractCegarLoop]: Abstraction has 4911 states and 10052 transitions.
[2022-02-09 00:16:34,564 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-02-09 00:16:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 10052 transitions.
[2022-02-09 00:16:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:34,568 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:34,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:34,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131
[2022-02-09 00:16:34,569 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash -888214493, now seen corresponding path program 106 times
[2022-02-09 00:16:34,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:34,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973101938]
[2022-02-09 00:16:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:34,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:35,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:35,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973101938]
[2022-02-09 00:16:35,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973101938] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:35,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:35,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:16:35,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719018006]
[2022-02-09 00:16:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:35,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:16:35,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:16:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:16:35,296 INFO L87 Difference]: Start difference. First operand 4911 states and 10052 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-02-09 00:16:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:40,497 INFO L93 Difference]: Finished difference Result 8895 states and 18276 transitions.
[2022-02-09 00:16:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:16:40,498 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-02-09 00:16:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:40,512 INFO L225 Difference]: With dead ends: 8895
[2022-02-09 00:16:40,513 INFO L226 Difference]: Without dead ends: 8895
[2022-02-09 00:16:40,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:16:40,514 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 1611 mSDsluCounter, 9746 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 10348 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:40,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 10348 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3662 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:16:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8895 states.
[2022-02-09 00:16:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8895 to 4913.
[2022-02-09 00:16:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 4910 states have (on average 2.0480651731160897) internal successors, (10056), 4912 states have internal predecessors, (10056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 10056 transitions.
[2022-02-09 00:16:40,606 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 10056 transitions. Word has length 99
[2022-02-09 00:16:40,606 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:40,607 INFO L470 AbstractCegarLoop]: Abstraction has 4913 states and 10056 transitions.
[2022-02-09 00:16:40,607 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-02-09 00:16:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 10056 transitions.
[2022-02-09 00:16:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:40,611 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:40,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:40,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132
[2022-02-09 00:16:40,612 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash 318954931, now seen corresponding path program 107 times
[2022-02-09 00:16:40,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:40,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035083644]
[2022-02-09 00:16:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:40,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:41,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:41,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035083644]
[2022-02-09 00:16:41,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035083644] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:41,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:41,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:16:41,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353800024]
[2022-02-09 00:16:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:41,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:16:41,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:41,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:16:41,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:16:41,428 INFO L87 Difference]: Start difference. First operand 4913 states and 10056 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-02-09 00:16:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:46,435 INFO L93 Difference]: Finished difference Result 7005 states and 14370 transitions.
[2022-02-09 00:16:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:16:46,435 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-02-09 00:16:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:46,446 INFO L225 Difference]: With dead ends: 7005
[2022-02-09 00:16:46,446 INFO L226 Difference]: Without dead ends: 7005
[2022-02-09 00:16:46,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=939, Invalid=4611, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:16:46,447 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1687 mSDsluCounter, 9326 mSDsCounter, 0 mSdLazyCounter, 3727 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 9896 SdHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:46,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1687 Valid, 9896 Invalid, 3764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3727 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:16:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states.
[2022-02-09 00:16:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 4895.
[2022-02-09 00:16:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4895 states, 4892 states have (on average 2.0478331970564185) internal successors, (10018), 4894 states have internal predecessors, (10018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 10018 transitions.
[2022-02-09 00:16:46,529 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 10018 transitions. Word has length 99
[2022-02-09 00:16:46,529 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:46,529 INFO L470 AbstractCegarLoop]: Abstraction has 4895 states and 10018 transitions.
[2022-02-09 00:16:46,529 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-02-09 00:16:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 10018 transitions.
[2022-02-09 00:16:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:46,534 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:46,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:46,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133
[2022-02-09 00:16:46,534 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:46,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1928805881, now seen corresponding path program 108 times
[2022-02-09 00:16:46,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:46,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110468513]
[2022-02-09 00:16:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:46,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:47,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:47,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110468513]
[2022-02-09 00:16:47,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110468513] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:47,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:47,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37
[2022-02-09 00:16:47,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338820498]
[2022-02-09 00:16:47,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:47,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-02-09 00:16:47,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:47,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-02-09 00:16:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332
[2022-02-09 00:16:47,661 INFO L87 Difference]: Start difference. First operand 4895 states and 10018 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-02-09 00:16:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:16:54,713 INFO L93 Difference]: Finished difference Result 8069 states and 16603 transitions.
[2022-02-09 00:16:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2022-02-09 00:16:54,713 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-02-09 00:16:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:16:54,729 INFO L225 Difference]: With dead ends: 8069
[2022-02-09 00:16:54,730 INFO L226 Difference]: Without dead ends: 8069
[2022-02-09 00:16:54,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1402, Invalid=7154, Unknown=0, NotChecked=0, Total=8556
[2022-02-09 00:16:54,731 INFO L933 BasicCegarLoop]: 564 mSDtfsCounter, 2133 mSDsluCounter, 10599 mSDsCounter, 0 mSdLazyCounter, 4778 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 11163 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:16:54,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2133 Valid, 11163 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4778 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2022-02-09 00:16:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8069 states.
[2022-02-09 00:16:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8069 to 5160.
[2022-02-09 00:16:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5160 states, 5157 states have (on average 2.0523560209424083) internal successors, (10584), 5159 states have internal predecessors, (10584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:16:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5160 states to 5160 states and 10584 transitions.
[2022-02-09 00:16:54,842 INFO L78 Accepts]: Start accepts. Automaton has 5160 states and 10584 transitions. Word has length 99
[2022-02-09 00:16:54,842 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:16:54,842 INFO L470 AbstractCegarLoop]: Abstraction has 5160 states and 10584 transitions.
[2022-02-09 00:16:54,842 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-02-09 00:16:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5160 states and 10584 transitions.
[2022-02-09 00:16:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:16:54,848 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:16:54,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:16:54,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134
[2022-02-09 00:16:54,848 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:16:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:16:54,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1264095435, now seen corresponding path program 109 times
[2022-02-09 00:16:54,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:16:54,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335315509]
[2022-02-09 00:16:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:16:54,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:16:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:16:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:16:55,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:16:55,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335315509]
[2022-02-09 00:16:55,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335315509] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:16:55,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:16:55,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:16:55,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427685020]
[2022-02-09 00:16:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:16:55,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:16:55,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:16:55,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:16:55,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:16:55,761 INFO L87 Difference]: Start difference. First operand 5160 states and 10584 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-02-09 00:17:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:00,802 INFO L93 Difference]: Finished difference Result 8485 states and 17439 transitions.
[2022-02-09 00:17:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:00,803 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-02-09 00:17:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:00,818 INFO L225 Difference]: With dead ends: 8485
[2022-02-09 00:17:00,818 INFO L226 Difference]: Without dead ends: 8485
[2022-02-09 00:17:00,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:17:00,819 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1696 mSDsluCounter, 9521 mSDsCounter, 0 mSdLazyCounter, 3857 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 10081 SdHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:00,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1696 Valid, 10081 Invalid, 3894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3857 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:17:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8485 states.
[2022-02-09 00:17:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8485 to 4893.
[2022-02-09 00:17:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4893 states, 4890 states have (on average 2.0478527607361965) internal successors, (10014), 4892 states have internal predecessors, (10014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 10014 transitions.
[2022-02-09 00:17:00,912 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 10014 transitions. Word has length 99
[2022-02-09 00:17:00,912 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:00,912 INFO L470 AbstractCegarLoop]: Abstraction has 4893 states and 10014 transitions.
[2022-02-09 00:17:00,912 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-02-09 00:17:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 10014 transitions.
[2022-02-09 00:17:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:00,917 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:00,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:00,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135
[2022-02-09 00:17:00,917 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash -253644005, now seen corresponding path program 110 times
[2022-02-09 00:17:00,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:00,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40852872]
[2022-02-09 00:17:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:00,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:01,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:01,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40852872]
[2022-02-09 00:17:01,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40852872] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:01,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:01,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:01,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290510008]
[2022-02-09 00:17:01,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:01,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:01,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:01,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:01,656 INFO L87 Difference]: Start difference. First operand 4893 states and 10014 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-02-09 00:17:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:04,931 INFO L93 Difference]: Finished difference Result 6690 states and 13721 transitions.
[2022-02-09 00:17:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:04,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-02-09 00:17:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:04,942 INFO L225 Difference]: With dead ends: 6690
[2022-02-09 00:17:04,942 INFO L226 Difference]: Without dead ends: 6690
[2022-02-09 00:17:04,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:17:04,943 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 1616 mSDsluCounter, 9365 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 9918 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:04,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1616 Valid, 9918 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:17:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6690 states.
[2022-02-09 00:17:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6690 to 4887.
[2022-02-09 00:17:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4884 states have (on average 2.0479115479115477) internal successors, (10002), 4886 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10002 transitions.
[2022-02-09 00:17:05,022 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10002 transitions. Word has length 99
[2022-02-09 00:17:05,022 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:05,022 INFO L470 AbstractCegarLoop]: Abstraction has 4887 states and 10002 transitions.
[2022-02-09 00:17:05,023 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-02-09 00:17:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10002 transitions.
[2022-02-09 00:17:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:05,028 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:05,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:05,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136
[2022-02-09 00:17:05,028 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1362747807, now seen corresponding path program 111 times
[2022-02-09 00:17:05,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:05,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388952654]
[2022-02-09 00:17:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:05,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:05,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:05,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388952654]
[2022-02-09 00:17:05,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388952654] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:05,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:05,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:05,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365780321]
[2022-02-09 00:17:05,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:05,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:05,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:05,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:05,595 INFO L87 Difference]: Start difference. First operand 4887 states and 10002 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-02-09 00:17:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:08,856 INFO L93 Difference]: Finished difference Result 7076 states and 14532 transitions.
[2022-02-09 00:17:08,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:08,857 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-02-09 00:17:08,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:08,903 INFO L225 Difference]: With dead ends: 7076
[2022-02-09 00:17:08,904 INFO L226 Difference]: Without dead ends: 7076
[2022-02-09 00:17:08,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:17:08,904 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 1583 mSDsluCounter, 8850 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 9412 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:08,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1583 Valid, 9412 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:17:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states.
[2022-02-09 00:17:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 4917.
[2022-02-09 00:17:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4917 states, 4914 states have (on average 2.048229548229548) internal successors, (10065), 4916 states have internal predecessors, (10065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 10065 transitions.
[2022-02-09 00:17:08,975 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 10065 transitions. Word has length 99
[2022-02-09 00:17:08,975 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:08,975 INFO L470 AbstractCegarLoop]: Abstraction has 4917 states and 10065 transitions.
[2022-02-09 00:17:08,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-02-09 00:17:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 10065 transitions.
[2022-02-09 00:17:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:08,980 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:08,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:08,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137
[2022-02-09 00:17:08,980 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1270104295, now seen corresponding path program 112 times
[2022-02-09 00:17:08,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:08,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198301792]
[2022-02-09 00:17:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:08,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:09,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-02-09 00:17:09,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:09,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198301792]
[2022-02-09 00:17:09,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198301792] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:09,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:09,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:09,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610772308]
[2022-02-09 00:17:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:09,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:09,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:09,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:09,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:09,504 INFO L87 Difference]: Start difference. First operand 4917 states and 10065 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-02-09 00:17:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:13,265 INFO L93 Difference]: Finished difference Result 9135 states and 18778 transitions.
[2022-02-09 00:17:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:17:13,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-02-09 00:17:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:13,281 INFO L225 Difference]: With dead ends: 9135
[2022-02-09 00:17:13,281 INFO L226 Difference]: Without dead ends: 9135
[2022-02-09 00:17:13,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:17:13,282 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 1619 mSDsluCounter, 10579 mSDsCounter, 0 mSdLazyCounter, 4119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 11187 SdHoareTripleChecker+Invalid, 4151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:13,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1619 Valid, 11187 Invalid, 4151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4119 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:17:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9135 states.
[2022-02-09 00:17:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9135 to 4919.
[2022-02-09 00:17:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 4916 states have (on average 2.0482099267697316) internal successors, (10069), 4918 states have internal predecessors, (10069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 10069 transitions.
[2022-02-09 00:17:13,376 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 10069 transitions. Word has length 99
[2022-02-09 00:17:13,376 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:13,376 INFO L470 AbstractCegarLoop]: Abstraction has 4919 states and 10069 transitions.
[2022-02-09 00:17:13,376 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-02-09 00:17:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 10069 transitions.
[2022-02-09 00:17:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:13,380 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:13,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:13,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138
[2022-02-09 00:17:13,381 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1817693577, now seen corresponding path program 113 times
[2022-02-09 00:17:13,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:13,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934811990]
[2022-02-09 00:17:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:13,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:13,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:13,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934811990]
[2022-02-09 00:17:13,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934811990] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:13,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:13,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:17:13,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987928071]
[2022-02-09 00:17:13,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:13,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:17:13,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:17:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:17:13,963 INFO L87 Difference]: Start difference. First operand 4919 states and 10069 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-02-09 00:17:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:17,498 INFO L93 Difference]: Finished difference Result 7177 states and 14736 transitions.
[2022-02-09 00:17:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:17,498 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-02-09 00:17:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:17,510 INFO L225 Difference]: With dead ends: 7177
[2022-02-09 00:17:17,510 INFO L226 Difference]: Without dead ends: 7177
[2022-02-09 00:17:17,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:17:17,511 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1741 mSDsluCounter, 9457 mSDsCounter, 0 mSdLazyCounter, 3750 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 10033 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:17,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1741 Valid, 10033 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3750 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:17:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states.
[2022-02-09 00:17:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 4901.
[2022-02-09 00:17:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4901 states, 4898 states have (on average 2.0479787668436096) internal successors, (10031), 4900 states have internal predecessors, (10031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 10031 transitions.
[2022-02-09 00:17:17,592 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 10031 transitions. Word has length 99
[2022-02-09 00:17:17,592 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:17,592 INFO L470 AbstractCegarLoop]: Abstraction has 4901 states and 10031 transitions.
[2022-02-09 00:17:17,592 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-02-09 00:17:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 10031 transitions.
[2022-02-09 00:17:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:17,597 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:17,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:17,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139
[2022-02-09 00:17:17,598 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 482050791, now seen corresponding path program 114 times
[2022-02-09 00:17:17,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:17,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691641522]
[2022-02-09 00:17:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:17,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:18,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:18,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691641522]
[2022-02-09 00:17:18,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691641522] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:18,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:18,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:18,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560336934]
[2022-02-09 00:17:18,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:18,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:18,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:18,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:18,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:18,139 INFO L87 Difference]: Start difference. First operand 4901 states and 10031 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-02-09 00:17:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:22,235 INFO L93 Difference]: Finished difference Result 9168 states and 18830 transitions.
[2022-02-09 00:17:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2022-02-09 00:17:22,236 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-02-09 00:17:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:22,252 INFO L225 Difference]: With dead ends: 9168
[2022-02-09 00:17:22,252 INFO L226 Difference]: Without dead ends: 9168
[2022-02-09 00:17:22,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1165, Invalid=5315, Unknown=0, NotChecked=0, Total=6480
[2022-02-09 00:17:22,253 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 1680 mSDsluCounter, 11051 mSDsCounter, 0 mSdLazyCounter, 3922 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 11683 SdHoareTripleChecker+Invalid, 3957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:22,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1680 Valid, 11683 Invalid, 3957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3922 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:17:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9168 states.
[2022-02-09 00:17:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9168 to 4902.
[2022-02-09 00:17:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4899 states have (on average 2.047968973259849) internal successors, (10033), 4901 states have internal predecessors, (10033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 10033 transitions.
[2022-02-09 00:17:22,365 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 10033 transitions. Word has length 99
[2022-02-09 00:17:22,365 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:22,366 INFO L470 AbstractCegarLoop]: Abstraction has 4902 states and 10033 transitions.
[2022-02-09 00:17:22,366 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-02-09 00:17:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 10033 transitions.
[2022-02-09 00:17:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:22,386 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:22,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:22,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140
[2022-02-09 00:17:22,387 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 460857719, now seen corresponding path program 115 times
[2022-02-09 00:17:22,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:22,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026540459]
[2022-02-09 00:17:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:22,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17: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-02-09 00:17:23,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:23,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026540459]
[2022-02-09 00:17:23,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026540459] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:23,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:23,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:17:23,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177470386]
[2022-02-09 00:17:23,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:23,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:17:23,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:23,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:17:23,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:17:23,130 INFO L87 Difference]: Start difference. First operand 4902 states and 10033 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-02-09 00:17:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:26,954 INFO L93 Difference]: Finished difference Result 8191 states and 16809 transitions.
[2022-02-09 00:17:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:17:26,954 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-02-09 00:17:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:26,967 INFO L225 Difference]: With dead ends: 8191
[2022-02-09 00:17:26,968 INFO L226 Difference]: Without dead ends: 8191
[2022-02-09 00:17:26,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1059, Invalid=5103, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:17:26,968 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 1796 mSDsluCounter, 9902 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 10502 SdHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:26,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1796 Valid, 10502 Invalid, 3717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-09 00:17:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8191 states.
[2022-02-09 00:17:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8191 to 4904.
[2022-02-09 00:17:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4904 states, 4901 states have (on average 2.0479493980820243) internal successors, (10037), 4903 states have internal predecessors, (10037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 10037 transitions.
[2022-02-09 00:17:27,063 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 10037 transitions. Word has length 99
[2022-02-09 00:17:27,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:27,063 INFO L470 AbstractCegarLoop]: Abstraction has 4904 states and 10037 transitions.
[2022-02-09 00:17:27,063 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-02-09 00:17:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 10037 transitions.
[2022-02-09 00:17:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:27,069 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:27,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:27,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141
[2022-02-09 00:17:27,069 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1373119753, now seen corresponding path program 116 times
[2022-02-09 00:17:27,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:27,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363423732]
[2022-02-09 00:17:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:27,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:27,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:27,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363423732]
[2022-02-09 00:17:27,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363423732] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:27,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:27,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:17:27,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825469645]
[2022-02-09 00:17:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:27,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:17:27,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:27,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:17:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:17:27,674 INFO L87 Difference]: Start difference. First operand 4904 states and 10037 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-02-09 00:17:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:31,641 INFO L93 Difference]: Finished difference Result 7146 states and 14655 transitions.
[2022-02-09 00:17:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:31,641 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-02-09 00:17:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:31,654 INFO L225 Difference]: With dead ends: 7146
[2022-02-09 00:17:31,654 INFO L226 Difference]: Without dead ends: 7146
[2022-02-09 00:17:31,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=950, Invalid=4750, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:17:31,655 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1514 mSDsluCounter, 10470 mSDsCounter, 0 mSdLazyCounter, 3970 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 11046 SdHoareTripleChecker+Invalid, 4010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:31,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 11046 Invalid, 4010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3970 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:17:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states.
[2022-02-09 00:17:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 4893.
[2022-02-09 00:17:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4893 states, 4890 states have (on average 2.0478527607361965) internal successors, (10014), 4892 states have internal predecessors, (10014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 10014 transitions.
[2022-02-09 00:17:31,770 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 10014 transitions. Word has length 99
[2022-02-09 00:17:31,770 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:31,770 INFO L470 AbstractCegarLoop]: Abstraction has 4893 states and 10014 transitions.
[2022-02-09 00:17:31,770 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-02-09 00:17:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 10014 transitions.
[2022-02-09 00:17:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:31,775 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:31,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:31,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142
[2022-02-09 00:17:31,776 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1405235159, now seen corresponding path program 117 times
[2022-02-09 00:17:31,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:31,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688956257]
[2022-02-09 00:17:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:31,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:32,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:32,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688956257]
[2022-02-09 00:17:32,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688956257] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:32,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:32,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:32,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043304355]
[2022-02-09 00:17:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:32,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:32,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:32,411 INFO L87 Difference]: Start difference. First operand 4893 states and 10014 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-02-09 00:17:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:35,678 INFO L93 Difference]: Finished difference Result 7419 states and 15254 transitions.
[2022-02-09 00:17:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:35,678 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-02-09 00:17:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:35,693 INFO L225 Difference]: With dead ends: 7419
[2022-02-09 00:17:35,693 INFO L226 Difference]: Without dead ends: 7419
[2022-02-09 00:17:35,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:17:35,694 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1754 mSDsluCounter, 8910 mSDsCounter, 0 mSdLazyCounter, 3516 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 9477 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:35,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1754 Valid, 9477 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3516 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:17:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states.
[2022-02-09 00:17:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 4911.
[2022-02-09 00:17:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4911 states, 4908 states have (on average 2.048084759576202) internal successors, (10052), 4910 states have internal predecessors, (10052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 10052 transitions.
[2022-02-09 00:17:35,784 INFO L78 Accepts]: Start accepts. Automaton has 4911 states and 10052 transitions. Word has length 99
[2022-02-09 00:17:35,784 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:35,784 INFO L470 AbstractCegarLoop]: Abstraction has 4911 states and 10052 transitions.
[2022-02-09 00:17:35,785 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-02-09 00:17:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 10052 transitions.
[2022-02-09 00:17:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:35,790 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:35,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:35,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143
[2022-02-09 00:17:35,790 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1497878671, now seen corresponding path program 118 times
[2022-02-09 00:17:35,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:35,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997932943]
[2022-02-09 00:17:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:35,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:36,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:36,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997932943]
[2022-02-09 00:17:36,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997932943] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:36,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:36,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:36,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773713257]
[2022-02-09 00:17:36,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:36,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:36,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:36,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:36,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:36,261 INFO L87 Difference]: Start difference. First operand 4911 states and 10052 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-02-09 00:17:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:40,187 INFO L93 Difference]: Finished difference Result 9366 states and 19257 transitions.
[2022-02-09 00:17:40,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:17:40,188 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-02-09 00:17:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:40,203 INFO L225 Difference]: With dead ends: 9366
[2022-02-09 00:17:40,204 INFO L226 Difference]: Without dead ends: 9366
[2022-02-09 00:17:40,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:17:40,205 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 1664 mSDsluCounter, 10224 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 10837 SdHoareTripleChecker+Invalid, 4110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:40,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1664 Valid, 10837 Invalid, 4110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:17:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9366 states.
[2022-02-09 00:17:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9366 to 4913.
[2022-02-09 00:17:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 4910 states have (on average 2.0480651731160897) internal successors, (10056), 4912 states have internal predecessors, (10056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 10056 transitions.
[2022-02-09 00:17:40,312 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 10056 transitions. Word has length 99
[2022-02-09 00:17:40,312 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:40,312 INFO L470 AbstractCegarLoop]: Abstraction has 4913 states and 10056 transitions.
[2022-02-09 00:17:40,312 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-02-09 00:17:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 10056 transitions.
[2022-02-09 00:17:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:40,318 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:40,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-02-09 00:17:40,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144
[2022-02-09 00:17:40,318 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -290709247, now seen corresponding path program 119 times
[2022-02-09 00:17:40,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:40,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111875869]
[2022-02-09 00:17:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:40,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:41,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:41,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111875869]
[2022-02-09 00:17:41,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111875869] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:41,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:41,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:41,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721116976]
[2022-02-09 00:17:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:41,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:41,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:41,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:41,035 INFO L87 Difference]: Start difference. First operand 4913 states and 10056 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-02-09 00:17:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:44,631 INFO L93 Difference]: Finished difference Result 7476 states and 15351 transitions.
[2022-02-09 00:17:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:44,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-02-09 00:17:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:44,644 INFO L225 Difference]: With dead ends: 7476
[2022-02-09 00:17:44,644 INFO L226 Difference]: Without dead ends: 7476
[2022-02-09 00:17:44,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=939, Invalid=4611, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:17:44,645 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 1516 mSDsluCounter, 10380 mSDsCounter, 0 mSdLazyCounter, 4151 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 10961 SdHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:44,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1516 Valid, 10961 Invalid, 4185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4151 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:17:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7476 states.
[2022-02-09 00:17:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7476 to 4895.
[2022-02-09 00:17:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4895 states, 4892 states have (on average 2.0478331970564185) internal successors, (10018), 4894 states have internal predecessors, (10018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 10018 transitions.
[2022-02-09 00:17:44,727 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 10018 transitions. Word has length 99
[2022-02-09 00:17:44,727 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:44,728 INFO L470 AbstractCegarLoop]: Abstraction has 4895 states and 10018 transitions.
[2022-02-09 00:17:44,728 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-02-09 00:17:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 10018 transitions.
[2022-02-09 00:17:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:44,732 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:44,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:44,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145
[2022-02-09 00:17:44,733 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1319141703, now seen corresponding path program 120 times
[2022-02-09 00:17:44,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:44,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150415690]
[2022-02-09 00:17:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:44,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:45,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:45,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150415690]
[2022-02-09 00:17:45,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150415690] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:45,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:45,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:45,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297082652]
[2022-02-09 00:17:45,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:45,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:45,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:45,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:45,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:45,305 INFO L87 Difference]: Start difference. First operand 4895 states and 10018 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-02-09 00:17:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:48,944 INFO L93 Difference]: Finished difference Result 7163 states and 14706 transitions.
[2022-02-09 00:17:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:48,945 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-02-09 00:17:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:48,958 INFO L225 Difference]: With dead ends: 7163
[2022-02-09 00:17:48,958 INFO L226 Difference]: Without dead ends: 7163
[2022-02-09 00:17:48,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:17:48,959 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 1642 mSDsluCounter, 8869 mSDsCounter, 0 mSdLazyCounter, 3601 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 9434 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:48,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1642 Valid, 9434 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3601 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:17:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7163 states.
[2022-02-09 00:17:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7163 to 4892.
[2022-02-09 00:17:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4889 states have (on average 2.047862548578441) internal successors, (10012), 4891 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 10012 transitions.
[2022-02-09 00:17:49,042 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 10012 transitions. Word has length 99
[2022-02-09 00:17:49,042 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:49,042 INFO L470 AbstractCegarLoop]: Abstraction has 4892 states and 10012 transitions.
[2022-02-09 00:17:49,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-02-09 00:17:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 10012 transitions.
[2022-02-09 00:17:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:49,047 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:49,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-02-09 00:17:49,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146
[2022-02-09 00:17:49,047 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2135537139, now seen corresponding path program 121 times
[2022-02-09 00:17:49,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:49,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402438726]
[2022-02-09 00:17:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:49,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:49,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:49,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402438726]
[2022-02-09 00:17:49,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402438726] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:49,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:49,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:49,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142880018]
[2022-02-09 00:17:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:49,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:49,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:49,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:49,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:49,636 INFO L87 Difference]: Start difference. First operand 4892 states and 10012 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-02-09 00:17:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:53,102 INFO L93 Difference]: Finished difference Result 7476 states and 15368 transitions.
[2022-02-09 00:17:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:17:53,102 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-02-09 00:17:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:53,115 INFO L225 Difference]: With dead ends: 7476
[2022-02-09 00:17:53,115 INFO L226 Difference]: Without dead ends: 7476
[2022-02-09 00:17:53,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:17:53,116 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1477 mSDsluCounter, 10319 mSDsCounter, 0 mSdLazyCounter, 4148 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 10886 SdHoareTripleChecker+Invalid, 4179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:53,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 10886 Invalid, 4179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4148 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:17:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7476 states.
[2022-02-09 00:17:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7476 to 4914.
[2022-02-09 00:17:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4911 states have (on average 2.0480553858684587) internal successors, (10058), 4913 states have internal predecessors, (10058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 10058 transitions.
[2022-02-09 00:17:53,201 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 10058 transitions. Word has length 99
[2022-02-09 00:17:53,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:53,201 INFO L470 AbstractCegarLoop]: Abstraction has 4914 states and 10058 transitions.
[2022-02-09 00:17:53,201 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-02-09 00:17:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 10058 transitions.
[2022-02-09 00:17:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:53,206 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:53,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:53,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147
[2022-02-09 00:17:53,206 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2042893627, now seen corresponding path program 122 times
[2022-02-09 00:17:53,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:53,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328560241]
[2022-02-09 00:17:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:53,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:53,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:53,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328560241]
[2022-02-09 00:17:53,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328560241] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:53,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:53,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:17:53,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140692892]
[2022-02-09 00:17:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:53,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:17:53,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:53,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:17:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:17:53,707 INFO L87 Difference]: Start difference. First operand 4914 states and 10058 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-02-09 00:17:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:17:57,331 INFO L93 Difference]: Finished difference Result 9423 states and 19371 transitions.
[2022-02-09 00:17:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:17:57,331 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-02-09 00:17:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:17:57,344 INFO L225 Difference]: With dead ends: 9423
[2022-02-09 00:17:57,345 INFO L226 Difference]: Without dead ends: 9423
[2022-02-09 00:17:57,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162
[2022-02-09 00:17:57,345 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 1759 mSDsluCounter, 10642 mSDsCounter, 0 mSdLazyCounter, 4168 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 11255 SdHoareTripleChecker+Invalid, 4211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:17:57,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1759 Valid, 11255 Invalid, 4211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4168 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:17:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9423 states.
[2022-02-09 00:17:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9423 to 4916.
[2022-02-09 00:17:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4916 states, 4913 states have (on average 2.04803582332587) internal successors, (10062), 4915 states have internal predecessors, (10062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:17:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 10062 transitions.
[2022-02-09 00:17:57,430 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 10062 transitions. Word has length 99
[2022-02-09 00:17:57,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:17:57,430 INFO L470 AbstractCegarLoop]: Abstraction has 4916 states and 10062 transitions.
[2022-02-09 00:17:57,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-02-09 00:17:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 10062 transitions.
[2022-02-09 00:17:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:17:57,435 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:17:57,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:17:57,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148
[2022-02-09 00:17:57,435 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:17:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:17:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1044904245, now seen corresponding path program 123 times
[2022-02-09 00:17:57,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:17:57,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654012505]
[2022-02-09 00:17:57,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:17:57,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:17:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:17:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:17:57,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:17:57,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654012505]
[2022-02-09 00:17:57,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654012505] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:17:57,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:17:57,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:17:57,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889014942]
[2022-02-09 00:17:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:17:57,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:17:57,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:17:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:17:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:17:57,996 INFO L87 Difference]: Start difference. First operand 4916 states and 10062 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-02-09 00:18:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:01,317 INFO L93 Difference]: Finished difference Result 7533 states and 15465 transitions.
[2022-02-09 00:18:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:18:01,317 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-02-09 00:18:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:01,328 INFO L225 Difference]: With dead ends: 7533
[2022-02-09 00:18:01,328 INFO L226 Difference]: Without dead ends: 7533
[2022-02-09 00:18:01,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=939, Invalid=4611, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:18:01,328 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 1713 mSDsluCounter, 9363 mSDsCounter, 0 mSdLazyCounter, 3720 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 9944 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:01,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1713 Valid, 9944 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3720 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-09 00:18:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7533 states.
[2022-02-09 00:18:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7533 to 4898.
[2022-02-09 00:18:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4898 states, 4895 states have (on average 2.0478038815117467) internal successors, (10024), 4897 states have internal predecessors, (10024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 10024 transitions.
[2022-02-09 00:18:01,404 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 10024 transitions. Word has length 99
[2022-02-09 00:18:01,404 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:01,404 INFO L470 AbstractCegarLoop]: Abstraction has 4898 states and 10024 transitions.
[2022-02-09 00:18:01,404 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-02-09 00:18:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 10024 transitions.
[2022-02-09 00:18:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:01,409 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:01,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:01,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149
[2022-02-09 00:18:01,409 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 564946705, now seen corresponding path program 124 times
[2022-02-09 00:18:01,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:01,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654343145]
[2022-02-09 00:18:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:01,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:02,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:02,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654343145]
[2022-02-09 00:18:02,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654343145] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:02,072 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:02,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:18:02,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189692444]
[2022-02-09 00:18:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:02,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:18:02,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:18:02,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:18:02,073 INFO L87 Difference]: Start difference. First operand 4898 states and 10024 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-02-09 00:18:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:06,355 INFO L93 Difference]: Finished difference Result 8234 states and 16928 transitions.
[2022-02-09 00:18:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:18:06,355 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-02-09 00:18:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:06,367 INFO L225 Difference]: With dead ends: 8234
[2022-02-09 00:18:06,367 INFO L226 Difference]: Without dead ends: 8234
[2022-02-09 00:18:06,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1129, Invalid=5677, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:18:06,368 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 1786 mSDsluCounter, 10644 mSDsCounter, 0 mSdLazyCounter, 4708 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 11219 SdHoareTripleChecker+Invalid, 4750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:06,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1786 Valid, 11219 Invalid, 4750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4708 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:18:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8234 states.
[2022-02-09 00:18:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8234 to 5163.
[2022-02-09 00:18:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5163 states, 5160 states have (on average 2.052325581395349) internal successors, (10590), 5162 states have internal predecessors, (10590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 10590 transitions.
[2022-02-09 00:18:06,452 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 10590 transitions. Word has length 99
[2022-02-09 00:18:06,452 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:06,452 INFO L470 AbstractCegarLoop]: Abstraction has 5163 states and 10590 transitions.
[2022-02-09 00:18:06,452 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-02-09 00:18:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 10590 transitions.
[2022-02-09 00:18:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:06,457 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:06,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:06,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150
[2022-02-09 00:18:06,457 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1667012685, now seen corresponding path program 125 times
[2022-02-09 00:18:06,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:06,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370676884]
[2022-02-09 00:18:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:06,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:07,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:07,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370676884]
[2022-02-09 00:18:07,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370676884] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:07,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:07,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:18:07,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542698129]
[2022-02-09 00:18:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:07,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:18:07,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:18:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:18:07,009 INFO L87 Difference]: Start difference. First operand 5163 states and 10590 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-02-09 00:18:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:10,542 INFO L93 Difference]: Finished difference Result 9013 states and 18534 transitions.
[2022-02-09 00:18:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:18:10,542 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-02-09 00:18:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:10,557 INFO L225 Difference]: With dead ends: 9013
[2022-02-09 00:18:10,557 INFO L226 Difference]: Without dead ends: 9013
[2022-02-09 00:18:10,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:18:10,558 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 1534 mSDsluCounter, 9746 mSDsCounter, 0 mSdLazyCounter, 4109 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 10317 SdHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:10,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 10317 Invalid, 4142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4109 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:18:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9013 states.
[2022-02-09 00:18:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9013 to 4896.
[2022-02-09 00:18:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4893 states have (on average 2.047823421213979) internal successors, (10020), 4895 states have internal predecessors, (10020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10020 transitions.
[2022-02-09 00:18:10,671 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10020 transitions. Word has length 99
[2022-02-09 00:18:10,671 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:10,671 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 10020 transitions.
[2022-02-09 00:18:10,672 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-02-09 00:18:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10020 transitions.
[2022-02-09 00:18:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:10,676 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:10,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:10,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151
[2022-02-09 00:18:10,676 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1617503181, now seen corresponding path program 126 times
[2022-02-09 00:18:10,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:10,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783928078]
[2022-02-09 00:18:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:10,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:11,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:11,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783928078]
[2022-02-09 00:18:11,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783928078] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:11,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:11,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2022-02-09 00:18:11,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333912477]
[2022-02-09 00:18:11,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:11,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-02-09 00:18:11,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-02-09 00:18:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260
[2022-02-09 00:18:11,660 INFO L87 Difference]: Start difference. First operand 4896 states and 10020 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-02-09 00:18:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:17,958 INFO L93 Difference]: Finished difference Result 7891 states and 16206 transitions.
[2022-02-09 00:18:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2022-02-09 00:18:17,959 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-02-09 00:18:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:17,970 INFO L225 Difference]: With dead ends: 7891
[2022-02-09 00:18:17,970 INFO L226 Difference]: Without dead ends: 7891
[2022-02-09 00:18:17,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1129, Invalid=5677, Unknown=0, NotChecked=0, Total=6806
[2022-02-09 00:18:17,971 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 1972 mSDsluCounter, 10723 mSDsCounter, 0 mSdLazyCounter, 4882 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 11291 SdHoareTripleChecker+Invalid, 4931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:17,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1972 Valid, 11291 Invalid, 4931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4882 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2022-02-09 00:18:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states.
[2022-02-09 00:18:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 5195.
[2022-02-09 00:18:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5195 states, 5192 states have (on average 2.0520030816640986) internal successors, (10654), 5194 states have internal predecessors, (10654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 10654 transitions.
[2022-02-09 00:18:18,083 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 10654 transitions. Word has length 99
[2022-02-09 00:18:18,083 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:18,083 INFO L470 AbstractCegarLoop]: Abstraction has 5195 states and 10654 transitions.
[2022-02-09 00:18:18,083 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-02-09 00:18:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 10654 transitions.
[2022-02-09 00:18:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:18,088 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:18,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:18,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152
[2022-02-09 00:18:18,088 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash -515437201, now seen corresponding path program 127 times
[2022-02-09 00:18:18,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:18,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497670859]
[2022-02-09 00:18:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:18,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:18,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:18,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497670859]
[2022-02-09 00:18:18,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497670859] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:18,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:18,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:18:18,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120067713]
[2022-02-09 00:18:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:18,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:18:18,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:18,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:18:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:18:18,926 INFO L87 Difference]: Start difference. First operand 5195 states and 10654 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-02-09 00:18:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:24,192 INFO L93 Difference]: Finished difference Result 8670 states and 17812 transitions.
[2022-02-09 00:18:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:18:24,193 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-02-09 00:18:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:24,206 INFO L225 Difference]: With dead ends: 8670
[2022-02-09 00:18:24,206 INFO L226 Difference]: Without dead ends: 8670
[2022-02-09 00:18:24,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:18:24,207 INFO L933 BasicCegarLoop]: 564 mSDtfsCounter, 1651 mSDsluCounter, 10554 mSDsCounter, 0 mSdLazyCounter, 4391 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 11118 SdHoareTripleChecker+Invalid, 4427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:24,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1651 Valid, 11118 Invalid, 4427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4391 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2022-02-09 00:18:24,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states.
[2022-02-09 00:18:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 4890.
[2022-02-09 00:18:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4887 states have (on average 2.0478821362799264) internal successors, (10008), 4889 states have internal predecessors, (10008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 10008 transitions.
[2022-02-09 00:18:24,298 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 10008 transitions. Word has length 99
[2022-02-09 00:18:24,298 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:24,298 INFO L470 AbstractCegarLoop]: Abstraction has 4890 states and 10008 transitions.
[2022-02-09 00:18:24,298 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-02-09 00:18:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 10008 transitions.
[2022-02-09 00:18:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:24,303 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:24,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:24,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153
[2022-02-09 00:18:24,303 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1800973723, now seen corresponding path program 128 times
[2022-02-09 00:18:24,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:24,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409882633]
[2022-02-09 00:18:24,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:24,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:25,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:25,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409882633]
[2022-02-09 00:18:25,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409882633] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:25,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:25,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:18:25,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149576504]
[2022-02-09 00:18:25,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:25,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:18:25,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:25,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:18:25,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:18:25,098 INFO L87 Difference]: Start difference. First operand 4890 states and 10008 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-02-09 00:18:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:30,064 INFO L93 Difference]: Finished difference Result 7046 states and 14469 transitions.
[2022-02-09 00:18:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:18:30,064 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-02-09 00:18:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:30,076 INFO L225 Difference]: With dead ends: 7046
[2022-02-09 00:18:30,076 INFO L226 Difference]: Without dead ends: 7046
[2022-02-09 00:18:30,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=944, Invalid=4606, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:18:30,077 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1551 mSDsluCounter, 9432 mSDsCounter, 0 mSdLazyCounter, 3787 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 9995 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:30,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1551 Valid, 9995 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3787 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-02-09 00:18:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states.
[2022-02-09 00:18:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 4918.
[2022-02-09 00:18:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4918 states, 4915 states have (on average 2.0480162767039674) internal successors, (10066), 4917 states have internal predecessors, (10066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4918 states to 4918 states and 10066 transitions.
[2022-02-09 00:18:30,155 INFO L78 Accepts]: Start accepts. Automaton has 4918 states and 10066 transitions. Word has length 99
[2022-02-09 00:18:30,155 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:30,155 INFO L470 AbstractCegarLoop]: Abstraction has 4918 states and 10066 transitions.
[2022-02-09 00:18:30,155 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-02-09 00:18:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4918 states and 10066 transitions.
[2022-02-09 00:18:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:30,160 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:30,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:30,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154
[2022-02-09 00:18:30,160 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1708330211, now seen corresponding path program 129 times
[2022-02-09 00:18:30,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:30,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049754922]
[2022-02-09 00:18:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:30,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:30,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:30,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049754922]
[2022-02-09 00:18:30,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049754922] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:30,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:30,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:18:30,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814356451]
[2022-02-09 00:18:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:30,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:18:30,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:18:30,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:18:30,879 INFO L87 Difference]: Start difference. First operand 4918 states and 10066 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-02-09 00:18:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:36,412 INFO L93 Difference]: Finished difference Result 8993 states and 18472 transitions.
[2022-02-09 00:18:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2022-02-09 00:18:36,413 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-02-09 00:18:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:36,426 INFO L225 Difference]: With dead ends: 8993
[2022-02-09 00:18:36,426 INFO L226 Difference]: Without dead ends: 8993
[2022-02-09 00:18:36,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006
[2022-02-09 00:18:36,427 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 1810 mSDsluCounter, 10139 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 10748 SdHoareTripleChecker+Invalid, 4057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:36,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1810 Valid, 10748 Invalid, 4057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4020 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-09 00:18:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states.
[2022-02-09 00:18:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 4920.
[2022-02-09 00:18:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4920 states, 4917 states have (on average 2.047996745983323) internal successors, (10070), 4919 states have internal predecessors, (10070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 10070 transitions.
[2022-02-09 00:18:36,506 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 10070 transitions. Word has length 99
[2022-02-09 00:18:36,506 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:36,506 INFO L470 AbstractCegarLoop]: Abstraction has 4920 states and 10070 transitions.
[2022-02-09 00:18:36,506 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-02-09 00:18:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 10070 transitions.
[2022-02-09 00:18:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:36,510 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:36,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-02-09 00:18:36,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155
[2022-02-09 00:18:36,511 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1379467661, now seen corresponding path program 130 times
[2022-02-09 00:18:36,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:36,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191969842]
[2022-02-09 00:18:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:36,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:37,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:37,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191969842]
[2022-02-09 00:18:37,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191969842] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:37,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:37,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-02-09 00:18:37,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153123956]
[2022-02-09 00:18:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:37,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-09 00:18:37,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:37,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-09 00:18:37,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056
[2022-02-09 00:18:37,360 INFO L87 Difference]: Start difference. First operand 4920 states and 10070 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-02-09 00:18:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:41,371 INFO L93 Difference]: Finished difference Result 7103 states and 14566 transitions.
[2022-02-09 00:18:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:18:41,371 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-02-09 00:18:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:41,380 INFO L225 Difference]: With dead ends: 7103
[2022-02-09 00:18:41,381 INFO L226 Difference]: Without dead ends: 7103
[2022-02-09 00:18:41,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700
[2022-02-09 00:18:41,381 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1580 mSDsluCounter, 9698 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 10275 SdHoareTripleChecker+Invalid, 3798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:41,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 10275 Invalid, 3798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3759 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-09 00:18:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7103 states.
[2022-02-09 00:18:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7103 to 4902.
[2022-02-09 00:18:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4899 states have (on average 2.0477648499693815) internal successors, (10032), 4901 states have internal predecessors, (10032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 10032 transitions.
[2022-02-09 00:18:41,448 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 10032 transitions. Word has length 99
[2022-02-09 00:18:41,448 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:41,448 INFO L470 AbstractCegarLoop]: Abstraction has 4902 states and 10032 transitions.
[2022-02-09 00:18:41,449 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-02-09 00:18:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 10032 transitions.
[2022-02-09 00:18:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:41,453 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:41,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:41,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156
[2022-02-09 00:18:41,453 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 230383289, now seen corresponding path program 131 times
[2022-02-09 00:18:41,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:41,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862377782]
[2022-02-09 00:18:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:41,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:42,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:42,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862377782]
[2022-02-09 00:18:42,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862377782] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:42,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:42,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:18:42,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534277463]
[2022-02-09 00:18:42,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:42,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:18:42,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:18:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:18:42,243 INFO L87 Difference]: Start difference. First operand 4902 states and 10032 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-02-09 00:18:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:46,237 INFO L93 Difference]: Finished difference Result 7131 states and 14639 transitions.
[2022-02-09 00:18:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:18:46,237 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-02-09 00:18:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:46,248 INFO L225 Difference]: With dead ends: 7131
[2022-02-09 00:18:46,249 INFO L226 Difference]: Without dead ends: 7131
[2022-02-09 00:18:46,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:18:46,249 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 1521 mSDsluCounter, 9559 mSDsCounter, 0 mSdLazyCounter, 3998 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 10126 SdHoareTripleChecker+Invalid, 4031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:46,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 10126 Invalid, 4031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3998 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-09 00:18:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7131 states.
[2022-02-09 00:18:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7131 to 4900.
[2022-02-09 00:18:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4900 states, 4897 states have (on average 2.0477843577700634) internal successors, (10028), 4899 states have internal predecessors, (10028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 10028 transitions.
[2022-02-09 00:18:46,321 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 10028 transitions. Word has length 99
[2022-02-09 00:18:46,321 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:46,321 INFO L470 AbstractCegarLoop]: Abstraction has 4900 states and 10028 transitions.
[2022-02-09 00:18:46,321 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-02-09 00:18:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 10028 transitions.
[2022-02-09 00:18:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:46,341 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:46,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:46,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157
[2022-02-09 00:18:46,341 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1952066597, now seen corresponding path program 132 times
[2022-02-09 00:18:46,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:46,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417353573]
[2022-02-09 00:18:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:46,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:47,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:47,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417353573]
[2022-02-09 00:18:47,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417353573] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:47,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:47,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:18:47,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688726722]
[2022-02-09 00:18:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:47,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:18:47,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:18:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:18:47,166 INFO L87 Difference]: Start difference. First operand 4900 states and 10028 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-02-09 00:18:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-09 00:18:51,402 INFO L93 Difference]: Finished difference Result 7182 states and 14741 transitions.
[2022-02-09 00:18:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-02-09 00:18:51,402 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-02-09 00:18:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-09 00:18:51,412 INFO L225 Difference]: With dead ends: 7182
[2022-02-09 00:18:51,412 INFO L226 Difference]: Without dead ends: 7182
[2022-02-09 00:18:51,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=943, Invalid=4607, Unknown=0, NotChecked=0, Total=5550
[2022-02-09 00:18:51,413 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1474 mSDsluCounter, 9822 mSDsCounter, 0 mSdLazyCounter, 3968 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 10388 SdHoareTripleChecker+Invalid, 4000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:51,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1474 Valid, 10388 Invalid, 4000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3968 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-09 00:18:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7182 states.
[2022-02-09 00:18:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7182 to 4896.
[2022-02-09 00:18:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4893 states have (on average 2.047823421213979) internal successors, (10020), 4895 states have internal predecessors, (10020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-09 00:18:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10020 transitions.
[2022-02-09 00:18:51,483 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10020 transitions. Word has length 99
[2022-02-09 00:18:51,483 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-09 00:18:51,483 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 10020 transitions.
[2022-02-09 00:18:51,483 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-02-09 00:18:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10020 transitions.
[2022-02-09 00:18:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2022-02-09 00:18:51,487 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-09 00:18:51,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-09 00:18:51,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158
[2022-02-09 00:18:51,487 INFO L402 AbstractCegarLoop]: === Iteration 160 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] ===
[2022-02-09 00:18:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-09 00:18:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -228584293, now seen corresponding path program 133 times
[2022-02-09 00:18:51,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-09 00:18:51,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466478669]
[2022-02-09 00:18:51,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-09 00:18:51,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-09 00:18:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-09 00:18:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-09 00:18:52,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-09 00:18:52,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466478669]
[2022-02-09 00:18:52,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466478669] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-09 00:18:52,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-09 00:18:52,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-02-09 00:18:52,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449363734]
[2022-02-09 00:18:52,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-09 00:18:52,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-02-09 00:18:52,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-09 00:18:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-02-09 00:18:52,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992
[2022-02-09 00:18:52,024 INFO L87 Difference]: Start difference. First operand 4896 states and 10020 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-02-09 00:18:53,028 WARN L244 SmtUtils]: Removed 10 from assertion stack
[2022-02-09 00:18:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-02-09 00:18:53,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=353, Invalid=1809, Unknown=0, NotChecked=0, Total=2162
[2022-02-09 00:18:53,029 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 391 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-02-09 00:18:53,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 1955 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-09 00:18:53,030 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2022-02-09 00:18:53,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159
[2022-02-09 00:18:53,030 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (4896states) and FLOYD_HOARE automaton (currently 18 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 41ms..
[2022-02-09 00:18:53,032 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2022-02-09 00:18:53,032 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining)
[2022-02-09 00:18:53,032 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining)
[2022-02-09 00:18:53,032 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 7 remaining)
[2022-02-09 00:18:53,032 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining)
[2022-02-09 00:18:53,032 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2022-02-09 00:18:53,035 INFO L732 BasicCegarLoop]: Path program histogram: [133, 24, 1, 1, 1]
[2022-02-09 00:18:53,041 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-02-09 00:18:53,041 INFO L180 ceAbstractionStarter]: Computing trace abstraction results
[2022-02-09 00:18:53,051 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-02-09 00:18:53,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 12:18:53 BasicIcfg
[2022-02-09 00:18:53,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-09 00:18:53,058 INFO L158 Benchmark]: Toolchain (without parser) took 859149.21ms. Allocated memory was 172.0MB in the beginning and 810.5MB in the end (delta: 638.6MB). Free memory was 113.7MB in the beginning and 590.3MB in the end (delta: -476.5MB). Peak memory consumption was 163.1MB. Max. memory is 8.0GB.
[2022-02-09 00:18:53,058 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-02-09 00:18:53,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.69ms. Allocated memory was 172.0MB in the beginning and 212.9MB in the end (delta: 40.9MB). Free memory was 113.5MB in the beginning and 173.1MB in the end (delta: -59.6MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB.
[2022-02-09 00:18:53,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 212.9MB. Free memory was 173.1MB in the beginning and 170.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2022-02-09 00:18:53,069 INFO L158 Benchmark]: Boogie Preprocessor took 23.89ms. Allocated memory is still 212.9MB. Free memory was 170.5MB in the beginning and 168.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-02-09 00:18:53,069 INFO L158 Benchmark]: RCFGBuilder took 321.46ms. Allocated memory is still 212.9MB. Free memory was 168.9MB in the beginning and 152.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB.
[2022-02-09 00:18:53,069 INFO L158 Benchmark]: TraceAbstraction took 858355.16ms. Allocated memory was 212.9MB in the beginning and 810.5MB in the end (delta: 597.7MB). Free memory was 151.6MB in the beginning and 590.3MB in the end (delta: -438.7MB). Peak memory consumption was 160.0MB. Max. memory is 8.0GB.
[2022-02-09 00:18:53,069 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 172.0MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 403.69ms. Allocated memory was 172.0MB in the beginning and 212.9MB in the end (delta: 40.9MB). Free memory was 113.5MB in the beginning and 173.1MB in the end (delta: -59.6MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 33.07ms. Allocated memory is still 212.9MB. Free memory was 173.1MB in the beginning and 170.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 23.89ms. Allocated memory is still 212.9MB. Free memory was 170.5MB in the beginning and 168.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 321.46ms. Allocated memory is still 212.9MB. Free memory was 168.9MB in the beginning and 152.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB.
* TraceAbstraction took 858355.16ms. Allocated memory was 212.9MB in the beginning and 810.5MB in the end (delta: 597.7MB). Free memory was 151.6MB in the beginning and 590.3MB in the end (delta: -438.7MB). Peak memory consumption was 160.0MB. 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 (4896states) and FLOYD_HOARE automaton (currently 18 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 41ms..
- TimeoutResultAtElement [Line: 836]: Timeout (TraceAbstraction)
Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (4896states) and FLOYD_HOARE automaton (currently 18 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 41ms..
- TimeoutResultAtElement [Line: 837]: Timeout (TraceAbstraction)
Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (4896states) and FLOYD_HOARE automaton (currently 18 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 41ms..
- 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 (4896states) and FLOYD_HOARE automaton (currently 18 states, 32 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 41ms..
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 3 procedures, 220 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 858.2s, OverallIterations: 160, TraceHistogramMax: 1, PathProgramHistogramMax: 133, EmptinessCheckTime: 0.7s, AutomataDifference: 728.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256838 SdHoareTripleChecker+Valid, 205.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256838 mSDsluCounter, 1516318 SdHoareTripleChecker+Invalid, 175.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1430498 mSDsCounter, 6133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563747 IncrementalHoareTripleChecker+Invalid, 569880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6133 mSolverCounterUnsat, 85820 mSDtfsCounter, 563747 mSolverCounterSat, 3.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12763 GetRequests, 659 SyntacticMatches, 94 SemanticMatches, 12009 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169237 ImplicationChecksByTransitivity, 564.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5264occurred in iteration=96, InterpolantAutomatonStates: 7724, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.7s AutomataMinimizationTime, 159 MinimizatonAttempts, 416200 StatesRemovedByMinimization, 158 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 115.2s InterpolantComputationTime, 15626 NumberOfCodeBlocks, 15626 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 15466 ConstructedInterpolants, 0 QuantifiedInterpolants, 280565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 160 InterpolantComputations, 160 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