/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.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 13:54:53,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 13:54:53,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 13:54:53,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 13:54:53,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 13:54:53,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 13:54:53,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 13:54:53,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 13:54:53,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 13:54:53,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 13:54:53,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 13:54:53,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 13:54:53,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 13:54:53,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 13:54:53,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 13:54:53,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 13:54:53,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 13:54:53,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 13:54:53,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 13:54:53,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 13:54:53,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 13:54:53,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 13:54:53,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 13:54:53,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 13:54:53,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 13:54:53,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 13:54:53,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 13:54:53,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 13:54:53,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 13:54:53,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 13:54:53,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 13:54:53,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 13:54:53,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 13:54:53,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 13:54:53,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 13:54:53,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 13:54:53,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 13:54:53,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 13:54:53,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 13:54:53,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 13:54:53,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 13:54:53,355 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 [2021-08-06 13:54:53,381 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 13:54:53,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 13:54:53,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-06 13:54:53,383 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-06 13:54:53,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 13:54:53,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 13:54:53,385 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 13:54:53,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 13:54:53,385 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 13:54:53,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 13:54:53,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 13:54:53,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 13:54:53,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 13:54:53,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 13:54:53,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 13:54:53,386 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 13:54:53,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 13:54:53,387 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 13:54:53,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 13:54:53,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 13:54:53,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 13:54:53,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 13:54:53,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 13:54:53,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:54:53,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 13:54:53,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 13:54:53,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 13:54:53,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 13:54:53,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 13:54:53,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 13:54:53,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 13:54:53,388 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 [2021-08-06 13:54:53,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 13:54:53,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 13:54:53,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 13:54:53,653 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 13:54:53,654 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 13:54:53,654 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 [2021-08-06 13:54:53,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ede97a4/f1c88aac652d441cbc7633c99d2e15d2/FLAGb5b4d5506 [2021-08-06 13:54:54,077 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 13:54:54,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2021-08-06 13:54:54,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ede97a4/f1c88aac652d441cbc7633c99d2e15d2/FLAGb5b4d5506 [2021-08-06 13:54:54,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ede97a4/f1c88aac652d441cbc7633c99d2e15d2 [2021-08-06 13:54:54,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 13:54:54,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 13:54:54,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 13:54:54,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 13:54:54,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 13:54:54,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363f577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54, skipping insertion in model container [2021-08-06 13:54:54,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 13:54:54,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 13:54:54,542 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-06 13:54:54,710 WARN L224 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] [2021-08-06 13:54:54,758 WARN L224 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] [2021-08-06 13:54:54,759 WARN L224 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] [2021-08-06 13:54:54,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:54:54,773 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 13:54:54,787 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-06 13:54:54,818 WARN L224 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] [2021-08-06 13:54:54,821 WARN L224 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] [2021-08-06 13:54:54,822 WARN L224 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] [2021-08-06 13:54:54,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:54:54,865 INFO L208 MainTranslator]: Completed translation [2021-08-06 13:54:54,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54 WrapperNode [2021-08-06 13:54:54,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 13:54:54,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 13:54:54,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 13:54:54,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 13:54:54,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 13:54:54,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 13:54:54,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 13:54:54,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 13:54:54,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 13:54:54,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 13:54:54,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 13:54:54,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 13:54:54,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (1/1) ... [2021-08-06 13:54:54,972 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:54:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 13:54:54,994 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) [2021-08-06 13:54:55,028 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 [2021-08-06 13:54:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2021-08-06 13:54:55,048 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2021-08-06 13:54:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 13:54:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 13:54:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-06 13:54:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 13:54:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 13:54:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 13:54:55,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 13:54:55,050 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 13:54:55,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 13:54:55,477 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-08-06 13:54:55,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:54:55 BoogieIcfgContainer [2021-08-06 13:54:55,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 13:54:55,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 13:54:55,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 13:54:55,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 13:54:55,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 01:54:54" (1/3) ... [2021-08-06 13:54:55,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0c6fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:54:55, skipping insertion in model container [2021-08-06 13:54:55,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:54" (2/3) ... [2021-08-06 13:54:55,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0c6fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:54:55, skipping insertion in model container [2021-08-06 13:54:55,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:54:55" (3/3) ... [2021-08-06 13:54:55,497 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2021-08-06 13:54:55,500 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 13:54:55,501 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 13:54:55,501 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-08-06 13:54:55,501 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 13:54:55,535 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,535 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,535 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,535 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,535 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,535 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,536 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,537 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,538 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,539 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,540 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,541 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,542 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,543 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,544 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,545 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,546 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,547 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,548 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,549 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,550 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,551 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,552 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,552 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,552 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,552 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,552 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,552 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,552 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,565 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,565 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,565 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,565 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,565 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,566 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,567 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,568 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,569 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,570 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,571 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,572 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,573 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,574 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,575 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,575 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,577 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,577 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,577 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,577 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,577 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,577 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,578 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,579 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,580 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,580 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,580 WARN L313 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,580 WARN L313 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:54:55,586 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-08-06 13:54:55,632 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_fnThread1of1ForFork0 ======== [2021-08-06 13:54:55,636 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 13:54:55,636 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-08-06 13:54:55,648 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 142 transitions, 292 flow [2021-08-06 13:54:55,716 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2067 states, 2064 states have (on average 2.142926356589147) internal successors, (4423), 2066 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 2067 states, 2064 states have (on average 2.142926356589147) internal successors, (4423), 2066 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-06 13:54:55,728 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:54:55,729 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:54:55,729 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:54:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:54:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1385072715, now seen corresponding path program 1 times [2021-08-06 13:54:55,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:54:55,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029598166] [2021-08-06 13:54:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:54:55,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:54:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:54:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:54:55,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:54:55,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029598166] [2021-08-06 13:54:55,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029598166] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:54:55,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:54:55,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-06 13:54:55,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232884708] [2021-08-06 13:54:55,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-06 13:54:55,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:54:55,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-06 13:54:55,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-06 13:54:55,944 INFO L87 Difference]: Start difference. First operand has 2067 states, 2064 states have (on average 2.142926356589147) internal successors, (4423), 2066 states have internal predecessors, (4423), 0 states have call successors, (0), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:54:55,982 INFO L93 Difference]: Finished difference Result 2067 states and 4201 transitions. [2021-08-06 13:54:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-06 13:54:55,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-06 13:54:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:54:56,006 INFO L225 Difference]: With dead ends: 2067 [2021-08-06 13:54:56,006 INFO L226 Difference]: Without dead ends: 2067 [2021-08-06 13:54:56,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-06 13:54:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2021-08-06 13:54:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2067. [2021-08-06 13:54:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2064 states have (on average 2.0353682170542635) internal successors, (4201), 2066 states have internal predecessors, (4201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4201 transitions. [2021-08-06 13:54:56,127 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4201 transitions. Word has length 35 [2021-08-06 13:54:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:54:56,128 INFO L470 AbstractCegarLoop]: Abstraction has 2067 states and 4201 transitions. [2021-08-06 13:54:56,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4201 transitions. [2021-08-06 13:54:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-06 13:54:56,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:54:56,129 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:54:56,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 13:54:56,129 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:54:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:54:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash 12387332, now seen corresponding path program 1 times [2021-08-06 13:54:56,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:54:56,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446885882] [2021-08-06 13:54:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:54:56,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:54:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:54:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:54:56,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:54:56,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446885882] [2021-08-06 13:54:56,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446885882] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:54:56,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:54:56,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-06 13:54:56,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107414923] [2021-08-06 13:54:56,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-06 13:54:56,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:54:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-06 13:54:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-06 13:54:56,216 INFO L87 Difference]: Start difference. First operand 2067 states and 4201 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:54:56,246 INFO L93 Difference]: Finished difference Result 3359 states and 6857 transitions. [2021-08-06 13:54:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-06 13:54:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-06 13:54:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:54:56,259 INFO L225 Difference]: With dead ends: 3359 [2021-08-06 13:54:56,259 INFO L226 Difference]: Without dead ends: 3359 [2021-08-06 13:54:56,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-06 13:54:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-08-06 13:54:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2543. [2021-08-06 13:54:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2540 states have (on average 2.0476377952755906) internal successors, (5201), 2542 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 5201 transitions. [2021-08-06 13:54:56,312 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 5201 transitions. Word has length 36 [2021-08-06 13:54:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:54:56,312 INFO L470 AbstractCegarLoop]: Abstraction has 2543 states and 5201 transitions. [2021-08-06 13:54:56,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 5201 transitions. [2021-08-06 13:54:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-06 13:54:56,317 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:54:56,317 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:54:56,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 13:54:56,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:54:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:54:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 761184174, now seen corresponding path program 1 times [2021-08-06 13:54:56,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:54:56,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567367611] [2021-08-06 13:54:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:54:56,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:54:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:54:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:54:56,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:54:56,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567367611] [2021-08-06 13:54:56,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567367611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:54:56,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:54:56,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-06 13:54:56,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888055933] [2021-08-06 13:54:56,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-06 13:54:56,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:54:56,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-06 13:54:56,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:54:56,831 INFO L87 Difference]: Start difference. First operand 2543 states and 5201 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:54:58,457 INFO L93 Difference]: Finished difference Result 2806 states and 5743 transitions. [2021-08-06 13:54:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-06 13:54:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-08-06 13:54:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:54:58,465 INFO L225 Difference]: With dead ends: 2806 [2021-08-06 13:54:58,466 INFO L226 Difference]: Without dead ends: 2691 [2021-08-06 13:54:58,466 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1245.1ms TimeCoverageRelationStatistics Valid=375, Invalid=1031, Unknown=0, NotChecked=0, Total=1406 [2021-08-06 13:54:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2021-08-06 13:54:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2499. [2021-08-06 13:54:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2496 states have (on average 2.0516826923076925) internal successors, (5121), 2498 states have internal predecessors, (5121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 5121 transitions. [2021-08-06 13:54:58,507 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 5121 transitions. Word has length 65 [2021-08-06 13:54:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:54:58,507 INFO L470 AbstractCegarLoop]: Abstraction has 2499 states and 5121 transitions. [2021-08-06 13:54:58,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:54:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 5121 transitions. [2021-08-06 13:54:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:54:58,511 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:54:58,511 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:54:58,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 13:54:58,511 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:54:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:54:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1137939345, now seen corresponding path program 1 times [2021-08-06 13:54:58,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:54:58,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382826702] [2021-08-06 13:54:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:54:58,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:54:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:54:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:54:59,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:54:59,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382826702] [2021-08-06 13:54:59,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382826702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:54:59,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:54:59,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-06 13:54:59,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734841357] [2021-08-06 13:54:59,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-06 13:54:59,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:54:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-06 13:54:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-08-06 13:54:59,377 INFO L87 Difference]: Start difference. First operand 2499 states and 5121 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:11,623 INFO L93 Difference]: Finished difference Result 3468 states and 7100 transitions. [2021-08-06 13:55:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-08-06 13:55:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:11,634 INFO L225 Difference]: With dead ends: 3468 [2021-08-06 13:55:11,634 INFO L226 Difference]: Without dead ends: 3468 [2021-08-06 13:55:11,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 10963.6ms TimeCoverageRelationStatistics Valid=3036, Invalid=7470, Unknown=0, NotChecked=0, Total=10506 [2021-08-06 13:55:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2021-08-06 13:55:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 2894. [2021-08-06 13:55:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2891 states have (on average 2.051193358699412) internal successors, (5930), 2893 states have internal predecessors, (5930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 5930 transitions. [2021-08-06 13:55:11,684 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 5930 transitions. Word has length 85 [2021-08-06 13:55:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:11,684 INFO L470 AbstractCegarLoop]: Abstraction has 2894 states and 5930 transitions. [2021-08-06 13:55:11,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 5930 transitions. [2021-08-06 13:55:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:11,688 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:11,688 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:11,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 13:55:11,688 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:55:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2136371281, now seen corresponding path program 2 times [2021-08-06 13:55:11,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:11,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029954758] [2021-08-06 13:55:11,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:11,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:12,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:12,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029954758] [2021-08-06 13:55:12,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029954758] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:12,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:12,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-06 13:55:12,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108572442] [2021-08-06 13:55:12,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-06 13:55:12,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:12,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-06 13:55:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2021-08-06 13:55:12,399 INFO L87 Difference]: Start difference. First operand 2894 states and 5930 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:26,267 INFO L93 Difference]: Finished difference Result 4383 states and 8992 transitions. [2021-08-06 13:55:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-08-06 13:55:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:26,282 INFO L225 Difference]: With dead ends: 4383 [2021-08-06 13:55:26,282 INFO L226 Difference]: Without dead ends: 4383 [2021-08-06 13:55:26,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 12322.3ms TimeCoverageRelationStatistics Valid=3762, Invalid=9120, Unknown=0, NotChecked=0, Total=12882 [2021-08-06 13:55:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2021-08-06 13:55:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 3158. [2021-08-06 13:55:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 3155 states have (on average 2.05229793977813) internal successors, (6475), 3157 states have internal predecessors, (6475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 6475 transitions. [2021-08-06 13:55:26,340 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 6475 transitions. Word has length 85 [2021-08-06 13:55:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:26,341 INFO L470 AbstractCegarLoop]: Abstraction has 3158 states and 6475 transitions. [2021-08-06 13:55:26,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 6475 transitions. [2021-08-06 13:55:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:26,344 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:26,345 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:26,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 13:55:26,345 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:55:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 515892591, now seen corresponding path program 3 times [2021-08-06 13:55:26,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:26,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343636831] [2021-08-06 13:55:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:26,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:27,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:27,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343636831] [2021-08-06 13:55:27,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343636831] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:27,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:27,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-06 13:55:27,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144733906] [2021-08-06 13:55:27,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-06 13:55:27,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-06 13:55:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2021-08-06 13:55:27,064 INFO L87 Difference]: Start difference. First operand 3158 states and 6475 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:42,560 INFO L93 Difference]: Finished difference Result 4503 states and 9234 transitions. [2021-08-06 13:55:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-08-06 13:55:42,561 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:42,573 INFO L225 Difference]: With dead ends: 4503 [2021-08-06 13:55:42,573 INFO L226 Difference]: Without dead ends: 4503 [2021-08-06 13:55:42,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 14181.2ms TimeCoverageRelationStatistics Valid=4383, Invalid=10869, Unknown=0, NotChecked=0, Total=15252 [2021-08-06 13:55:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2021-08-06 13:55:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 3167. [2021-08-06 13:55:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3164 states have (on average 2.052465233881163) internal successors, (6494), 3166 states have internal predecessors, (6494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 6494 transitions. [2021-08-06 13:55:42,626 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 6494 transitions. Word has length 85 [2021-08-06 13:55:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:42,626 INFO L470 AbstractCegarLoop]: Abstraction has 3167 states and 6494 transitions. [2021-08-06 13:55:42,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 6494 transitions. [2021-08-06 13:55:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:42,630 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:42,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:42,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 13:55:42,631 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:55:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1257140399, now seen corresponding path program 4 times [2021-08-06 13:55:42,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:42,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838664566] [2021-08-06 13:55:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:42,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:43,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:43,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838664566] [2021-08-06 13:55:43,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838664566] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:43,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:43,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-06 13:55:43,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031197958] [2021-08-06 13:55:43,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-06 13:55:43,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:43,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-06 13:55:43,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2021-08-06 13:55:43,253 INFO L87 Difference]: Start difference. First operand 3167 states and 6494 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:54,873 INFO L93 Difference]: Finished difference Result 4118 states and 8438 transitions. [2021-08-06 13:55:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-08-06 13:55:54,873 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:54,882 INFO L225 Difference]: With dead ends: 4118 [2021-08-06 13:55:54,882 INFO L226 Difference]: Without dead ends: 4118 [2021-08-06 13:55:54,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 10587.7ms TimeCoverageRelationStatistics Valid=3410, Invalid=8362, Unknown=0, NotChecked=0, Total=11772 [2021-08-06 13:55:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2021-08-06 13:55:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 2895. [2021-08-06 13:55:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2892 states have (on average 2.050829875518672) internal successors, (5931), 2894 states have internal predecessors, (5931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5931 transitions. [2021-08-06 13:55:54,928 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5931 transitions. Word has length 85 [2021-08-06 13:55:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:54,929 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 5931 transitions. [2021-08-06 13:55:54,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5931 transitions. [2021-08-06 13:55:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:54,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:54,932 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:54,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 13:55:54,932 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:55:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash -959742609, now seen corresponding path program 5 times [2021-08-06 13:55:54,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:54,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094424560] [2021-08-06 13:55:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:54,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:55,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:55,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094424560] [2021-08-06 13:55:55,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094424560] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:55,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:55,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-06 13:55:55,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289488824] [2021-08-06 13:55:55,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-06 13:55:55,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-06 13:55:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2021-08-06 13:55:55,583 INFO L87 Difference]: Start difference. First operand 2895 states and 5931 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:56:02,933 INFO L93 Difference]: Finished difference Result 3811 states and 7820 transitions. [2021-08-06 13:56:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 13:56:02,933 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:56:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:56:02,939 INFO L225 Difference]: With dead ends: 3811 [2021-08-06 13:56:02,939 INFO L226 Difference]: Without dead ends: 3811 [2021-08-06 13:56:02,940 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 6613.6ms TimeCoverageRelationStatistics Valid=1611, Invalid=3791, Unknown=0, NotChecked=0, Total=5402 [2021-08-06 13:56:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2021-08-06 13:56:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 2897. [2021-08-06 13:56:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2894 states have (on average 2.0507947477539736) internal successors, (5935), 2896 states have internal predecessors, (5935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 5935 transitions. [2021-08-06 13:56:02,979 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 5935 transitions. Word has length 85 [2021-08-06 13:56:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:56:02,980 INFO L470 AbstractCegarLoop]: Abstraction has 2897 states and 5935 transitions. [2021-08-06 13:56:02,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 5935 transitions. [2021-08-06 13:56:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:56:02,982 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:56:02,983 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:56:02,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 13:56:02,983 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:56:02,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:56:02,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1692521263, now seen corresponding path program 6 times [2021-08-06 13:56:02,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:56:02,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259435878] [2021-08-06 13:56:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:56:02,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:56:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:56:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:56:03,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:56:03,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259435878] [2021-08-06 13:56:03,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259435878] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:56:03,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:56:03,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-06 13:56:03,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859371500] [2021-08-06 13:56:03,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-06 13:56:03,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:56:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-06 13:56:03,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2021-08-06 13:56:03,612 INFO L87 Difference]: Start difference. First operand 2897 states and 5935 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:56:14,703 INFO L93 Difference]: Finished difference Result 4079 states and 8378 transitions. [2021-08-06 13:56:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-08-06 13:56:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:56:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:56:14,710 INFO L225 Difference]: With dead ends: 4079 [2021-08-06 13:56:14,710 INFO L226 Difference]: Without dead ends: 4079 [2021-08-06 13:56:14,710 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 9931.7ms TimeCoverageRelationStatistics Valid=2508, Invalid=5864, Unknown=0, NotChecked=0, Total=8372 [2021-08-06 13:56:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2021-08-06 13:56:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 2906. [2021-08-06 13:56:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2903 states have (on average 2.0509817430244572) internal successors, (5954), 2905 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 5954 transitions. [2021-08-06 13:56:14,752 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 5954 transitions. Word has length 85 [2021-08-06 13:56:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:56:14,752 INFO L470 AbstractCegarLoop]: Abstraction has 2906 states and 5954 transitions. [2021-08-06 13:56:14,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 5954 transitions. [2021-08-06 13:56:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:56:14,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:56:14,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:56:14,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 13:56:14,755 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:56:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:56:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1861198225, now seen corresponding path program 7 times [2021-08-06 13:56:14,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:56:14,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19146989] [2021-08-06 13:56:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:56:14,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:56:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:56:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:56:15,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:56:15,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19146989] [2021-08-06 13:56:15,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19146989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:56:15,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:56:15,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-06 13:56:15,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136432582] [2021-08-06 13:56:15,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-06 13:56:15,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:56:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-06 13:56:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2021-08-06 13:56:15,394 INFO L87 Difference]: Start difference. First operand 2906 states and 5954 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:56:29,769 INFO L93 Difference]: Finished difference Result 4099 states and 8405 transitions. [2021-08-06 13:56:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-08-06 13:56:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:56:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:56:29,776 INFO L225 Difference]: With dead ends: 4099 [2021-08-06 13:56:29,776 INFO L226 Difference]: Without dead ends: 4099 [2021-08-06 13:56:29,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2435 ImplicationChecksByTransitivity, 12825.7ms TimeCoverageRelationStatistics Valid=4273, Invalid=10489, Unknown=0, NotChecked=0, Total=14762 [2021-08-06 13:56:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2021-08-06 13:56:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 2895. [2021-08-06 13:56:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2892 states have (on average 2.050829875518672) internal successors, (5931), 2894 states have internal predecessors, (5931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5931 transitions. [2021-08-06 13:56:29,817 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5931 transitions. Word has length 85 [2021-08-06 13:56:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:56:29,817 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 5931 transitions. [2021-08-06 13:56:29,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5931 transitions. [2021-08-06 13:56:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:56:29,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:56:29,821 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:56:29,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 13:56:29,821 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:56:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:56:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1684613763, now seen corresponding path program 8 times [2021-08-06 13:56:29,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:56:29,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036061348] [2021-08-06 13:56:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:56:29,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:56:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:56:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:56:30,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:56:30,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036061348] [2021-08-06 13:56:30,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036061348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:56:30,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:56:30,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-06 13:56:30,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374787924] [2021-08-06 13:56:30,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-06 13:56:30,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:56:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-06 13:56:30,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2021-08-06 13:56:30,580 INFO L87 Difference]: Start difference. First operand 2895 states and 5931 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:56:37,473 INFO L93 Difference]: Finished difference Result 3618 states and 7415 transitions. [2021-08-06 13:56:37,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-06 13:56:37,473 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:56:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:56:37,478 INFO L225 Difference]: With dead ends: 3618 [2021-08-06 13:56:37,478 INFO L226 Difference]: Without dead ends: 3618 [2021-08-06 13:56:37,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 6248.8ms TimeCoverageRelationStatistics Valid=1391, Invalid=3439, Unknown=0, NotChecked=0, Total=4830 [2021-08-06 13:56:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2021-08-06 13:56:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 3146. [2021-08-06 13:56:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3143 states have (on average 2.0531339484568885) internal successors, (6453), 3145 states have internal predecessors, (6453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 6453 transitions. [2021-08-06 13:56:37,517 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 6453 transitions. Word has length 85 [2021-08-06 13:56:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:56:37,517 INFO L470 AbstractCegarLoop]: Abstraction has 3146 states and 6453 transitions. [2021-08-06 13:56:37,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 6453 transitions. [2021-08-06 13:56:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:56:37,520 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:56:37,521 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:56:37,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 13:56:37,521 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:56:37,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:56:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1869105725, now seen corresponding path program 9 times [2021-08-06 13:56:37,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:56:37,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217372540] [2021-08-06 13:56:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:56:37,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:56:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:56:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:56:38,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:56:38,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217372540] [2021-08-06 13:56:38,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217372540] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:56:38,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:56:38,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-06 13:56:38,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731174903] [2021-08-06 13:56:38,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-06 13:56:38,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:56:38,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-06 13:56:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2021-08-06 13:56:38,207 INFO L87 Difference]: Start difference. First operand 3146 states and 6453 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:56:55,543 INFO L93 Difference]: Finished difference Result 3915 states and 8019 transitions. [2021-08-06 13:56:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-08-06 13:56:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:56:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:56:55,548 INFO L225 Difference]: With dead ends: 3915 [2021-08-06 13:56:55,548 INFO L226 Difference]: Without dead ends: 3915 [2021-08-06 13:56:55,549 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3078 ImplicationChecksByTransitivity, 15899.0ms TimeCoverageRelationStatistics Valid=5039, Invalid=12783, Unknown=0, NotChecked=0, Total=17822 [2021-08-06 13:56:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2021-08-06 13:56:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3150. [2021-08-06 13:56:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 3147 states have (on average 2.0530664124563076) internal successors, (6461), 3149 states have internal predecessors, (6461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 6461 transitions. [2021-08-06 13:56:55,588 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 6461 transitions. Word has length 85 [2021-08-06 13:56:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:56:55,588 INFO L470 AbstractCegarLoop]: Abstraction has 3150 states and 6461 transitions. [2021-08-06 13:56:55,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 6461 transitions. [2021-08-06 13:56:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:56:55,591 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:56:55,592 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:56:55,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 13:56:55,592 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:56:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:56:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 582002913, now seen corresponding path program 10 times [2021-08-06 13:56:55,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:56:55,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669688345] [2021-08-06 13:56:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:56:55,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:56:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:56:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:56:56,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:56:56,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669688345] [2021-08-06 13:56:56,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669688345] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:56:56,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:56:56,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-06 13:56:56,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224635580] [2021-08-06 13:56:56,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-06 13:56:56,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:56:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-06 13:56:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2021-08-06 13:56:56,242 INFO L87 Difference]: Start difference. First operand 3150 states and 6461 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:09,190 INFO L93 Difference]: Finished difference Result 3696 states and 7574 transitions. [2021-08-06 13:57:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-08-06 13:57:09,190 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:57:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:09,194 INFO L225 Difference]: With dead ends: 3696 [2021-08-06 13:57:09,194 INFO L226 Difference]: Without dead ends: 3696 [2021-08-06 13:57:09,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 11930.5ms TimeCoverageRelationStatistics Valid=3861, Invalid=9711, Unknown=0, NotChecked=0, Total=13572 [2021-08-06 13:57:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2021-08-06 13:57:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 2556. [2021-08-06 13:57:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2553 states have (on average 2.0505287896592246) internal successors, (5235), 2555 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 5235 transitions. [2021-08-06 13:57:09,227 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 5235 transitions. Word has length 85 [2021-08-06 13:57:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:09,227 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 5235 transitions. [2021-08-06 13:57:09,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 5235 transitions. [2021-08-06 13:57:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:09,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:09,231 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:09,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 13:57:09,231 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1277330547, now seen corresponding path program 1 times [2021-08-06 13:57:09,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:09,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093647120] [2021-08-06 13:57:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:09,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:10,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:10,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093647120] [2021-08-06 13:57:10,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093647120] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:10,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:10,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:57:10,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842856037] [2021-08-06 13:57:10,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:57:10,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:10,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:57:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:57:10,335 INFO L87 Difference]: Start difference. First operand 2556 states and 5235 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:16,070 INFO L93 Difference]: Finished difference Result 4831 states and 9927 transitions. [2021-08-06 13:57:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 13:57:16,070 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:57:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:16,075 INFO L225 Difference]: With dead ends: 4831 [2021-08-06 13:57:16,075 INFO L226 Difference]: Without dead ends: 4831 [2021-08-06 13:57:16,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 4567.0ms TimeCoverageRelationStatistics Valid=1185, Invalid=5457, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 13:57:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2021-08-06 13:57:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 3624. [2021-08-06 13:57:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3621 states have (on average 2.0538525269262635) internal successors, (7437), 3623 states have internal predecessors, (7437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 7437 transitions. [2021-08-06 13:57:16,116 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 7437 transitions. Word has length 88 [2021-08-06 13:57:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:16,116 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 7437 transitions. [2021-08-06 13:57:16,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 7437 transitions. [2021-08-06 13:57:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:16,119 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:16,119 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:16,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 13:57:16,120 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash 763817129, now seen corresponding path program 2 times [2021-08-06 13:57:16,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:16,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213730640] [2021-08-06 13:57:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:16,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:17,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:17,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213730640] [2021-08-06 13:57:17,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213730640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:17,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:17,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:57:17,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141776309] [2021-08-06 13:57:17,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:57:17,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:17,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:57:17,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:57:17,178 INFO L87 Difference]: Start difference. First operand 3624 states and 7437 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:22,603 INFO L93 Difference]: Finished difference Result 5088 states and 10448 transitions. [2021-08-06 13:57:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:57:22,603 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:57:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:22,608 INFO L225 Difference]: With dead ends: 5088 [2021-08-06 13:57:22,608 INFO L226 Difference]: Without dead ends: 5088 [2021-08-06 13:57:22,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 4159.3ms TimeCoverageRelationStatistics Valid=1052, Invalid=4954, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:57:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2021-08-06 13:57:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 3639. [2021-08-06 13:57:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3636 states have (on average 2.0536303630363038) internal successors, (7467), 3638 states have internal predecessors, (7467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 7467 transitions. [2021-08-06 13:57:22,662 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 7467 transitions. Word has length 88 [2021-08-06 13:57:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:22,662 INFO L470 AbstractCegarLoop]: Abstraction has 3639 states and 7467 transitions. [2021-08-06 13:57:22,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 7467 transitions. [2021-08-06 13:57:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:22,665 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:22,665 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:22,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-06 13:57:22,666 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 125614841, now seen corresponding path program 3 times [2021-08-06 13:57:22,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:22,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409830010] [2021-08-06 13:57:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:22,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:23,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:23,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409830010] [2021-08-06 13:57:23,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409830010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:23,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:23,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:57:23,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365689603] [2021-08-06 13:57:23,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:57:23,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:57:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:57:23,675 INFO L87 Difference]: Start difference. First operand 3639 states and 7467 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:29,317 INFO L93 Difference]: Finished difference Result 5178 states and 10643 transitions. [2021-08-06 13:57:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 13:57:29,318 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:57:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:29,323 INFO L225 Difference]: With dead ends: 5178 [2021-08-06 13:57:29,323 INFO L226 Difference]: Without dead ends: 5178 [2021-08-06 13:57:29,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 4399.3ms TimeCoverageRelationStatistics Valid=1095, Invalid=5067, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 13:57:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2021-08-06 13:57:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 3759. [2021-08-06 13:57:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3756 states have (on average 2.0559105431309903) internal successors, (7722), 3758 states have internal predecessors, (7722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 7722 transitions. [2021-08-06 13:57:29,372 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 7722 transitions. Word has length 88 [2021-08-06 13:57:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:29,373 INFO L470 AbstractCegarLoop]: Abstraction has 3759 states and 7722 transitions. [2021-08-06 13:57:29,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 7722 transitions. [2021-08-06 13:57:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:29,377 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:29,377 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:29,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-06 13:57:29,377 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1629753341, now seen corresponding path program 4 times [2021-08-06 13:57:29,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:29,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544028050] [2021-08-06 13:57:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:29,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:30,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:30,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544028050] [2021-08-06 13:57:30,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544028050] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:30,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:30,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:57:30,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916914661] [2021-08-06 13:57:30,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:57:30,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:30,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:57:30,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:57:30,431 INFO L87 Difference]: Start difference. First operand 3759 states and 7722 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:35,720 INFO L93 Difference]: Finished difference Result 5313 states and 10928 transitions. [2021-08-06 13:57:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:57:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:57:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:35,725 INFO L225 Difference]: With dead ends: 5313 [2021-08-06 13:57:35,725 INFO L226 Difference]: Without dead ends: 5313 [2021-08-06 13:57:35,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4191.3ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:57:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2021-08-06 13:57:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 3774. [2021-08-06 13:57:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3771 states have (on average 2.0556881463802705) internal successors, (7752), 3773 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 7752 transitions. [2021-08-06 13:57:35,765 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 7752 transitions. Word has length 88 [2021-08-06 13:57:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:35,765 INFO L470 AbstractCegarLoop]: Abstraction has 3774 states and 7752 transitions. [2021-08-06 13:57:35,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 7752 transitions. [2021-08-06 13:57:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:35,769 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:35,769 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:35,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-06 13:57:35,769 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 185759053, now seen corresponding path program 5 times [2021-08-06 13:57:35,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:35,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029782000] [2021-08-06 13:57:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:35,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:36,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:36,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029782000] [2021-08-06 13:57:36,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029782000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:36,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:36,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:57:36,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576740314] [2021-08-06 13:57:36,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:57:36,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:57:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:57:36,786 INFO L87 Difference]: Start difference. First operand 3774 states and 7752 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:42,259 INFO L93 Difference]: Finished difference Result 5358 states and 11018 transitions. [2021-08-06 13:57:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:57:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:57:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:42,265 INFO L225 Difference]: With dead ends: 5358 [2021-08-06 13:57:42,265 INFO L226 Difference]: Without dead ends: 5358 [2021-08-06 13:57:42,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4176.5ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:57:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5358 states. [2021-08-06 13:57:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5358 to 3804. [2021-08-06 13:57:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3801 states have (on average 2.0552486187845305) internal successors, (7812), 3803 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 7812 transitions. [2021-08-06 13:57:42,334 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 7812 transitions. Word has length 88 [2021-08-06 13:57:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:42,335 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 7812 transitions. [2021-08-06 13:57:42,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 7812 transitions. [2021-08-06 13:57:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:42,338 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:42,338 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:42,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-06 13:57:42,338 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1219852225, now seen corresponding path program 6 times [2021-08-06 13:57:42,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:42,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427854640] [2021-08-06 13:57:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:42,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:43,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:43,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427854640] [2021-08-06 13:57:43,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427854640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:43,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:43,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:57:43,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723965222] [2021-08-06 13:57:43,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:57:43,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:43,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:57:43,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:57:43,326 INFO L87 Difference]: Start difference. First operand 3804 states and 7812 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:48,797 INFO L93 Difference]: Finished difference Result 5418 states and 11138 transitions. [2021-08-06 13:57:48,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:57:48,798 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:57:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:48,803 INFO L225 Difference]: With dead ends: 5418 [2021-08-06 13:57:48,803 INFO L226 Difference]: Without dead ends: 5418 [2021-08-06 13:57:48,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 4172.5ms TimeCoverageRelationStatistics Valid=1057, Invalid=4949, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:57:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2021-08-06 13:57:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 3834. [2021-08-06 13:57:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3834 states, 3831 states have (on average 2.0548159749412687) internal successors, (7872), 3833 states have internal predecessors, (7872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 7872 transitions. [2021-08-06 13:57:48,848 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 7872 transitions. Word has length 88 [2021-08-06 13:57:48,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:48,848 INFO L470 AbstractCegarLoop]: Abstraction has 3834 states and 7872 transitions. [2021-08-06 13:57:48,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 7872 transitions. [2021-08-06 13:57:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:48,852 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:48,852 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:48,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-06 13:57:48,852 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash -367208527, now seen corresponding path program 7 times [2021-08-06 13:57:48,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:48,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454536663] [2021-08-06 13:57:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:48,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:49,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:49,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454536663] [2021-08-06 13:57:49,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454536663] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:49,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:49,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:57:49,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556093877] [2021-08-06 13:57:49,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:57:49,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:57:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:57:49,899 INFO L87 Difference]: Start difference. First operand 3834 states and 7872 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:55,355 INFO L93 Difference]: Finished difference Result 5463 states and 11228 transitions. [2021-08-06 13:57:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:57:55,355 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:57:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:55,360 INFO L225 Difference]: With dead ends: 5463 [2021-08-06 13:57:55,360 INFO L226 Difference]: Without dead ends: 5463 [2021-08-06 13:57:55,361 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 4161.6ms TimeCoverageRelationStatistics Valid=1057, Invalid=4949, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:57:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2021-08-06 13:57:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 3849. [2021-08-06 13:57:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3846 states have (on average 2.0546021840873636) internal successors, (7902), 3848 states have internal predecessors, (7902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 7902 transitions. [2021-08-06 13:57:55,398 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 7902 transitions. Word has length 88 [2021-08-06 13:57:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:55,398 INFO L470 AbstractCegarLoop]: Abstraction has 3849 states and 7902 transitions. [2021-08-06 13:57:55,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 7902 transitions. [2021-08-06 13:57:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:57:55,401 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:55,401 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:55,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-06 13:57:55,402 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:57:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 502636665, now seen corresponding path program 8 times [2021-08-06 13:57:55,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:55,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210484253] [2021-08-06 13:57:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:55,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:56,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:56,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210484253] [2021-08-06 13:57:56,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210484253] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:56,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:56,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:57:56,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517735218] [2021-08-06 13:57:56,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:57:56,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:57:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:57:56,398 INFO L87 Difference]: Start difference. First operand 3849 states and 7902 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:01,918 INFO L93 Difference]: Finished difference Result 5493 states and 11288 transitions. [2021-08-06 13:58:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:58:01,918 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:01,924 INFO L225 Difference]: With dead ends: 5493 [2021-08-06 13:58:01,924 INFO L226 Difference]: Without dead ends: 5493 [2021-08-06 13:58:01,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4143.7ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:58:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5493 states. [2021-08-06 13:58:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5493 to 3864. [2021-08-06 13:58:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3861 states have (on average 2.0543900543900544) internal successors, (7932), 3863 states have internal predecessors, (7932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 7932 transitions. [2021-08-06 13:58:01,964 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 7932 transitions. Word has length 88 [2021-08-06 13:58:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:01,964 INFO L470 AbstractCegarLoop]: Abstraction has 3864 states and 7932 transitions. [2021-08-06 13:58:01,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 7932 transitions. [2021-08-06 13:58:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:01,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:01,968 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:01,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-06 13:58:01,968 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:01,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:01,968 INFO L82 PathProgramCache]: Analyzing trace with hash 88686025, now seen corresponding path program 9 times [2021-08-06 13:58:01,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:01,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20766418] [2021-08-06 13:58:01,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:01,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:02,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:02,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20766418] [2021-08-06 13:58:02,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20766418] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:02,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:02,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:58:02,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910898556] [2021-08-06 13:58:02,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:58:02,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:58:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:58:02,957 INFO L87 Difference]: Start difference. First operand 3864 states and 7932 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:08,111 INFO L93 Difference]: Finished difference Result 5553 states and 11408 transitions. [2021-08-06 13:58:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:58:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:08,118 INFO L225 Difference]: With dead ends: 5553 [2021-08-06 13:58:08,118 INFO L226 Difference]: Without dead ends: 5553 [2021-08-06 13:58:08,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 4125.5ms TimeCoverageRelationStatistics Valid=1056, Invalid=4950, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:58:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5553 states. [2021-08-06 13:58:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5553 to 3909. [2021-08-06 13:58:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3906 states have (on average 2.053763440860215) internal successors, (8022), 3908 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 8022 transitions. [2021-08-06 13:58:08,168 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 8022 transitions. Word has length 88 [2021-08-06 13:58:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:08,168 INFO L470 AbstractCegarLoop]: Abstraction has 3909 states and 8022 transitions. [2021-08-06 13:58:08,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 8022 transitions. [2021-08-06 13:58:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:08,172 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:08,173 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:08,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-06 13:58:08,173 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash -554146413, now seen corresponding path program 10 times [2021-08-06 13:58:08,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:08,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971506948] [2021-08-06 13:58:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:08,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:09,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:09,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971506948] [2021-08-06 13:58:09,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971506948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:09,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:09,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:58:09,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120663005] [2021-08-06 13:58:09,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:58:09,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:09,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:58:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:58:09,178 INFO L87 Difference]: Start difference. First operand 3909 states and 8022 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:14,562 INFO L93 Difference]: Finished difference Result 5313 states and 10913 transitions. [2021-08-06 13:58:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:58:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:14,567 INFO L225 Difference]: With dead ends: 5313 [2021-08-06 13:58:14,568 INFO L226 Difference]: Without dead ends: 5313 [2021-08-06 13:58:14,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 4124.7ms TimeCoverageRelationStatistics Valid=1057, Invalid=4949, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:58:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2021-08-06 13:58:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 3909. [2021-08-06 13:58:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3906 states have (on average 2.053763440860215) internal successors, (8022), 3908 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 8022 transitions. [2021-08-06 13:58:14,605 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 8022 transitions. Word has length 88 [2021-08-06 13:58:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:14,606 INFO L470 AbstractCegarLoop]: Abstraction has 3909 states and 8022 transitions. [2021-08-06 13:58:14,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 8022 transitions. [2021-08-06 13:58:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:14,609 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:14,609 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:14,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-06 13:58:14,609 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -708269163, now seen corresponding path program 11 times [2021-08-06 13:58:14,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:14,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663048288] [2021-08-06 13:58:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:14,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:15,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:15,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663048288] [2021-08-06 13:58:15,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663048288] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:15,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:15,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:58:15,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626086678] [2021-08-06 13:58:15,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:58:15,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:58:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:58:15,703 INFO L87 Difference]: Start difference. First operand 3909 states and 8022 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:21,810 INFO L93 Difference]: Finished difference Result 6577 states and 13535 transitions. [2021-08-06 13:58:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 13:58:21,811 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:21,817 INFO L225 Difference]: With dead ends: 6577 [2021-08-06 13:58:21,817 INFO L226 Difference]: Without dead ends: 6577 [2021-08-06 13:58:21,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4677.4ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 13:58:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2021-08-06 13:58:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 3942. [2021-08-06 13:58:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3939 states have (on average 2.053820766692054) internal successors, (8090), 3941 states have internal predecessors, (8090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 8090 transitions. [2021-08-06 13:58:21,855 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 8090 transitions. Word has length 88 [2021-08-06 13:58:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:21,855 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 8090 transitions. [2021-08-06 13:58:21,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 8090 transitions. [2021-08-06 13:58:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:21,859 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:21,859 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:21,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-06 13:58:21,859 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1221782581, now seen corresponding path program 12 times [2021-08-06 13:58:21,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:21,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169994015] [2021-08-06 13:58:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:21,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:22,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:22,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169994015] [2021-08-06 13:58:22,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169994015] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:22,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:22,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:58:22,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902162866] [2021-08-06 13:58:22,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:58:22,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:22,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:58:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:58:22,926 INFO L87 Difference]: Start difference. First operand 3942 states and 8090 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:28,833 INFO L93 Difference]: Finished difference Result 5855 states and 12034 transitions. [2021-08-06 13:58:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:58:28,833 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:28,839 INFO L225 Difference]: With dead ends: 5855 [2021-08-06 13:58:28,839 INFO L226 Difference]: Without dead ends: 5855 [2021-08-06 13:58:28,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4615.0ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:58:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2021-08-06 13:58:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 3940. [2021-08-06 13:58:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3937 states have (on average 2.0538481076962154) internal successors, (8086), 3939 states have internal predecessors, (8086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 8086 transitions. [2021-08-06 13:58:28,890 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 8086 transitions. Word has length 88 [2021-08-06 13:58:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:28,890 INFO L470 AbstractCegarLoop]: Abstraction has 3940 states and 8086 transitions. [2021-08-06 13:58:28,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 8086 transitions. [2021-08-06 13:58:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:28,893 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:28,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:28,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-06 13:58:28,894 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:28,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1859984869, now seen corresponding path program 13 times [2021-08-06 13:58:28,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:28,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520070942] [2021-08-06 13:58:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:28,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:29,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:29,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520070942] [2021-08-06 13:58:29,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520070942] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:29,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:29,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:58:29,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615879651] [2021-08-06 13:58:29,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:58:29,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:58:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:58:29,945 INFO L87 Difference]: Start difference. First operand 3940 states and 8086 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:36,289 INFO L93 Difference]: Finished difference Result 5894 states and 12127 transitions. [2021-08-06 13:58:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 13:58:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:36,306 INFO L225 Difference]: With dead ends: 5894 [2021-08-06 13:58:36,306 INFO L226 Difference]: Without dead ends: 5894 [2021-08-06 13:58:36,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4854.4ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 13:58:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2021-08-06 13:58:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 3924. [2021-08-06 13:58:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3921 states have (on average 2.053557765876052) internal successors, (8052), 3923 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) [2021-08-06 13:58:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 8052 transitions. [2021-08-06 13:58:36,343 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 8052 transitions. Word has length 88 [2021-08-06 13:58:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:36,344 INFO L470 AbstractCegarLoop]: Abstraction has 3924 states and 8052 transitions. [2021-08-06 13:58:36,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 8052 transitions. [2021-08-06 13:58:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:36,347 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:36,347 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:36,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-06 13:58:36,347 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash 679614245, now seen corresponding path program 14 times [2021-08-06 13:58:36,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:36,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580121106] [2021-08-06 13:58:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:36,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:37,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:37,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580121106] [2021-08-06 13:58:37,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580121106] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:37,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:37,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:58:37,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266461621] [2021-08-06 13:58:37,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:58:37,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:37,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:58:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:58:37,502 INFO L87 Difference]: Start difference. First operand 3924 states and 8052 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:43,108 INFO L93 Difference]: Finished difference Result 6029 states and 12412 transitions. [2021-08-06 13:58:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:58:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:43,114 INFO L225 Difference]: With dead ends: 6029 [2021-08-06 13:58:43,114 INFO L226 Difference]: Without dead ends: 6029 [2021-08-06 13:58:43,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4371.0ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 13:58:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2021-08-06 13:58:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3922. [2021-08-06 13:58:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3919 states have (on average 2.053585098239347) internal successors, (8048), 3921 states have internal predecessors, (8048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 8048 transitions. [2021-08-06 13:58:43,151 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 8048 transitions. Word has length 88 [2021-08-06 13:58:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:43,151 INFO L470 AbstractCegarLoop]: Abstraction has 3922 states and 8048 transitions. [2021-08-06 13:58:43,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 8048 transitions. [2021-08-06 13:58:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:43,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:43,154 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:43,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-06 13:58:43,155 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1799840657, now seen corresponding path program 15 times [2021-08-06 13:58:43,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:43,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190262936] [2021-08-06 13:58:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:43,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:44,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:44,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190262936] [2021-08-06 13:58:44,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190262936] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:44,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:44,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:58:44,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740481861] [2021-08-06 13:58:44,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:58:44,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:58:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:58:44,289 INFO L87 Difference]: Start difference. First operand 3922 states and 8048 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:50,063 INFO L93 Difference]: Finished difference Result 5894 states and 12127 transitions. [2021-08-06 13:58:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:58:50,063 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:50,069 INFO L225 Difference]: With dead ends: 5894 [2021-08-06 13:58:50,069 INFO L226 Difference]: Without dead ends: 5894 [2021-08-06 13:58:50,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4383.1ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 13:58:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2021-08-06 13:58:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 3918. [2021-08-06 13:58:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3915 states have (on average 2.053639846743295) internal successors, (8040), 3917 states have internal predecessors, (8040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 8040 transitions. [2021-08-06 13:58:50,110 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 8040 transitions. Word has length 88 [2021-08-06 13:58:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:50,110 INFO L470 AbstractCegarLoop]: Abstraction has 3918 states and 8040 transitions. [2021-08-06 13:58:50,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 8040 transitions. [2021-08-06 13:58:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:50,113 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:50,114 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:50,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-06 13:58:50,114 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1628602923, now seen corresponding path program 16 times [2021-08-06 13:58:50,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:50,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369956126] [2021-08-06 13:58:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:50,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:51,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:51,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369956126] [2021-08-06 13:58:51,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369956126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:51,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:51,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:58:51,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857043325] [2021-08-06 13:58:51,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:58:51,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:51,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:58:51,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:58:51,134 INFO L87 Difference]: Start difference. First operand 3918 states and 8040 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:57,211 INFO L93 Difference]: Finished difference Result 6373 states and 13110 transitions. [2021-08-06 13:58:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-06 13:58:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:58:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:57,217 INFO L225 Difference]: With dead ends: 6373 [2021-08-06 13:58:57,217 INFO L226 Difference]: Without dead ends: 6373 [2021-08-06 13:58:57,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 4816.1ms TimeCoverageRelationStatistics Valid=1221, Invalid=5585, Unknown=0, NotChecked=0, Total=6806 [2021-08-06 13:58:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2021-08-06 13:58:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 3945. [2021-08-06 13:58:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3945 states, 3942 states have (on average 2.054033485540335) internal successors, (8097), 3944 states have internal predecessors, (8097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3945 states and 8097 transitions. [2021-08-06 13:58:57,259 INFO L78 Accepts]: Start accepts. Automaton has 3945 states and 8097 transitions. Word has length 88 [2021-08-06 13:58:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:57,259 INFO L470 AbstractCegarLoop]: Abstraction has 3945 states and 8097 transitions. [2021-08-06 13:58:57,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3945 states and 8097 transitions. [2021-08-06 13:58:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:58:57,262 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:57,262 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:57,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-06 13:58:57,263 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:58:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2142116341, now seen corresponding path program 17 times [2021-08-06 13:58:57,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:57,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983188044] [2021-08-06 13:58:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:57,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:58,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:58,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983188044] [2021-08-06 13:58:58,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983188044] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:58,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:58,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:58:58,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140321963] [2021-08-06 13:58:58,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:58:58,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:58:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:58:58,285 INFO L87 Difference]: Start difference. First operand 3945 states and 8097 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:03,935 INFO L93 Difference]: Finished difference Result 5651 states and 11609 transitions. [2021-08-06 13:59:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 13:59:03,935 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:03,941 INFO L225 Difference]: With dead ends: 5651 [2021-08-06 13:59:03,941 INFO L226 Difference]: Without dead ends: 5651 [2021-08-06 13:59:03,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 4401.7ms TimeCoverageRelationStatistics Valid=1088, Invalid=5074, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 13:59:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2021-08-06 13:59:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3943. [2021-08-06 13:59:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3940 states have (on average 2.054060913705584) internal successors, (8093), 3942 states have internal predecessors, (8093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 8093 transitions. [2021-08-06 13:59:03,980 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 8093 transitions. Word has length 88 [2021-08-06 13:59:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:03,980 INFO L470 AbstractCegarLoop]: Abstraction has 3943 states and 8093 transitions. [2021-08-06 13:59:03,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 8093 transitions. [2021-08-06 13:59:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:03,984 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:03,984 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:03,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-06 13:59:03,984 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1514648667, now seen corresponding path program 18 times [2021-08-06 13:59:03,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:03,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496137656] [2021-08-06 13:59:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:03,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:04,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:04,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496137656] [2021-08-06 13:59:04,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496137656] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:04,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:04,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:59:04,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612032939] [2021-08-06 13:59:04,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:59:04,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:04,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:59:04,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:59:04,995 INFO L87 Difference]: Start difference. First operand 3943 states and 8093 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:11,006 INFO L93 Difference]: Finished difference Result 5555 states and 11417 transitions. [2021-08-06 13:59:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 13:59:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:11,012 INFO L225 Difference]: With dead ends: 5555 [2021-08-06 13:59:11,012 INFO L226 Difference]: Without dead ends: 5555 [2021-08-06 13:59:11,012 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 4586.9ms TimeCoverageRelationStatistics Valid=1132, Invalid=5188, Unknown=0, NotChecked=0, Total=6320 [2021-08-06 13:59:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2021-08-06 13:59:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 3927. [2021-08-06 13:59:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3924 states have (on average 2.0537716615698267) internal successors, (8059), 3926 states have internal predecessors, (8059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 8059 transitions. [2021-08-06 13:59:11,051 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 8059 transitions. Word has length 88 [2021-08-06 13:59:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:11,052 INFO L470 AbstractCegarLoop]: Abstraction has 3927 states and 8059 transitions. [2021-08-06 13:59:11,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 8059 transitions. [2021-08-06 13:59:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:11,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:11,054 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:11,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-06 13:59:11,055 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:11,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1271874995, now seen corresponding path program 19 times [2021-08-06 13:59:11,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:11,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644239565] [2021-08-06 13:59:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:11,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:12,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:12,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644239565] [2021-08-06 13:59:12,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644239565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:12,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:12,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:59:12,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682792422] [2021-08-06 13:59:12,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:59:12,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:59:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:59:12,103 INFO L87 Difference]: Start difference. First operand 3927 states and 8059 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:18,668 INFO L93 Difference]: Finished difference Result 6396 states and 13147 transitions. [2021-08-06 13:59:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-06 13:59:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:18,674 INFO L225 Difference]: With dead ends: 6396 [2021-08-06 13:59:18,674 INFO L226 Difference]: Without dead ends: 6396 [2021-08-06 13:59:18,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 5210.7ms TimeCoverageRelationStatistics Valid=1306, Invalid=5834, Unknown=0, NotChecked=0, Total=7140 [2021-08-06 13:59:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6396 states. [2021-08-06 13:59:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6396 to 3954. [2021-08-06 13:59:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 13:59:18,713 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 13:59:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:18,714 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 13:59:18,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 13:59:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:18,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:18,716 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:18,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-06 13:59:18,717 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1942604137, now seen corresponding path program 20 times [2021-08-06 13:59:18,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:18,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906534510] [2021-08-06 13:59:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:18,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:19,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:19,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906534510] [2021-08-06 13:59:19,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906534510] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:19,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:19,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:59:19,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22530653] [2021-08-06 13:59:19,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:59:19,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:59:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:59:19,810 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:25,727 INFO L93 Difference]: Finished difference Result 6314 states and 12976 transitions. [2021-08-06 13:59:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 13:59:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:25,748 INFO L225 Difference]: With dead ends: 6314 [2021-08-06 13:59:25,748 INFO L226 Difference]: Without dead ends: 6314 [2021-08-06 13:59:25,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 4747.5ms TimeCoverageRelationStatistics Valid=1178, Invalid=5464, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 13:59:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2021-08-06 13:59:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 3956. [2021-08-06 13:59:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-06 13:59:25,788 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-06 13:59:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:25,788 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-06 13:59:25,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-06 13:59:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:25,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:25,791 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:25,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-06 13:59:25,791 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1116203095, now seen corresponding path program 21 times [2021-08-06 13:59:25,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:25,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340093641] [2021-08-06 13:59:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:25,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:26,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:26,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340093641] [2021-08-06 13:59:26,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340093641] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:26,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:26,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:59:26,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167700533] [2021-08-06 13:59:26,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:59:26,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:26,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:59:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:59:26,776 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:32,282 INFO L93 Difference]: Finished difference Result 5481 states and 11253 transitions. [2021-08-06 13:59:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:59:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:32,288 INFO L225 Difference]: With dead ends: 5481 [2021-08-06 13:59:32,288 INFO L226 Difference]: Without dead ends: 5481 [2021-08-06 13:59:32,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 4243.7ms TimeCoverageRelationStatistics Valid=1047, Invalid=4959, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:59:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2021-08-06 13:59:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 3954. [2021-08-06 13:59:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 13:59:32,326 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 13:59:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:32,327 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 13:59:32,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 13:59:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:32,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:32,330 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:32,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-06 13:59:32,330 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1180072201, now seen corresponding path program 22 times [2021-08-06 13:59:32,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:32,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121351839] [2021-08-06 13:59:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:32,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:33,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:33,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121351839] [2021-08-06 13:59:33,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121351839] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:33,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:33,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:59:33,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071841453] [2021-08-06 13:59:33,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:59:33,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:59:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:59:33,394 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:39,599 INFO L93 Difference]: Finished difference Result 6552 states and 13486 transitions. [2021-08-06 13:59:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 13:59:39,599 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:39,606 INFO L225 Difference]: With dead ends: 6552 [2021-08-06 13:59:39,606 INFO L226 Difference]: Without dead ends: 6552 [2021-08-06 13:59:39,606 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4760.1ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 13:59:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2021-08-06 13:59:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 3974. [2021-08-06 13:59:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3971 states have (on average 2.0538907076303197) internal successors, (8156), 3973 states have internal predecessors, (8156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 8156 transitions. [2021-08-06 13:59:39,648 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 8156 transitions. Word has length 88 [2021-08-06 13:59:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:39,648 INFO L470 AbstractCegarLoop]: Abstraction has 3974 states and 8156 transitions. [2021-08-06 13:59:39,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 8156 transitions. [2021-08-06 13:59:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:39,651 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:39,651 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:39,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-06 13:59:39,651 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:39,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1693585619, now seen corresponding path program 23 times [2021-08-06 13:59:39,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:39,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151092945] [2021-08-06 13:59:39,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:39,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:40,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:40,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151092945] [2021-08-06 13:59:40,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151092945] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:40,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:40,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:59:40,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242020843] [2021-08-06 13:59:40,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:59:40,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:40,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:59:40,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:59:40,695 INFO L87 Difference]: Start difference. First operand 3974 states and 8156 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:46,257 INFO L93 Difference]: Finished difference Result 5830 states and 11985 transitions. [2021-08-06 13:59:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 13:59:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:46,264 INFO L225 Difference]: With dead ends: 5830 [2021-08-06 13:59:46,264 INFO L226 Difference]: Without dead ends: 5830 [2021-08-06 13:59:46,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 4428.0ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 13:59:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2021-08-06 13:59:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 3972. [2021-08-06 13:59:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3969 states have (on average 2.053917863441673) internal successors, (8152), 3971 states have internal predecessors, (8152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 8152 transitions. [2021-08-06 13:59:46,313 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 8152 transitions. Word has length 88 [2021-08-06 13:59:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:46,314 INFO L470 AbstractCegarLoop]: Abstraction has 3972 states and 8152 transitions. [2021-08-06 13:59:46,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 8152 transitions. [2021-08-06 13:59:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:46,316 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:46,316 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:46,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-06 13:59:46,317 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1963179389, now seen corresponding path program 24 times [2021-08-06 13:59:46,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:46,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541659749] [2021-08-06 13:59:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:46,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:47,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:47,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541659749] [2021-08-06 13:59:47,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541659749] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:47,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:47,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 13:59:47,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291406685] [2021-08-06 13:59:47,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 13:59:47,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:47,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 13:59:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 13:59:47,301 INFO L87 Difference]: Start difference. First operand 3972 states and 8152 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:53,400 INFO L93 Difference]: Finished difference Result 5869 states and 12078 transitions. [2021-08-06 13:59:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 13:59:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 13:59:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:53,406 INFO L225 Difference]: With dead ends: 5869 [2021-08-06 13:59:53,406 INFO L226 Difference]: Without dead ends: 5869 [2021-08-06 13:59:53,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4557.3ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 13:59:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5869 states. [2021-08-06 13:59:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5869 to 3956. [2021-08-06 13:59:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-06 13:59:53,443 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-06 13:59:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:53,462 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-06 13:59:53,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-06 13:59:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 13:59:53,465 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:53,465 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:53,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-06 13:59:53,465 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 13:59:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash -544672603, now seen corresponding path program 25 times [2021-08-06 13:59:53,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:53,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780784100] [2021-08-06 13:59:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:53,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:54,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:54,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780784100] [2021-08-06 13:59:54,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780784100] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:54,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:54,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 13:59:54,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599003688] [2021-08-06 13:59:54,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 13:59:54,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:54,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 13:59:54,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 13:59:54,585 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:00,162 INFO L93 Difference]: Finished difference Result 5701 states and 11725 transitions. [2021-08-06 14:00:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:00:00,162 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:00,168 INFO L225 Difference]: With dead ends: 5701 [2021-08-06 14:00:00,168 INFO L226 Difference]: Without dead ends: 5701 [2021-08-06 14:00:00,168 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4381.0ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:00:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2021-08-06 14:00:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 3954. [2021-08-06 14:00:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 14:00:00,202 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 14:00:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:00,203 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 14:00:00,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 14:00:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:00,205 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:00,205 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:00,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-06 14:00:00,205 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2098470203, now seen corresponding path program 26 times [2021-08-06 14:00:00,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:00,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090119885] [2021-08-06 14:00:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:00,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:01,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:01,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090119885] [2021-08-06 14:00:01,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090119885] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:01,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:01,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:00:01,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512262913] [2021-08-06 14:00:01,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:00:01,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:01,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:00:01,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:00:01,253 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:07,678 INFO L93 Difference]: Finished difference Result 6671 states and 13724 transitions. [2021-08-06 14:00:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:00:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:07,686 INFO L225 Difference]: With dead ends: 6671 [2021-08-06 14:00:07,687 INFO L226 Difference]: Without dead ends: 6671 [2021-08-06 14:00:07,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4900.2ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:00:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2021-08-06 14:00:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 3982. [2021-08-06 14:00:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3979 states have (on average 2.053782357376225) internal successors, (8172), 3981 states have internal predecessors, (8172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 8172 transitions. [2021-08-06 14:00:07,736 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 8172 transitions. Word has length 88 [2021-08-06 14:00:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:07,736 INFO L470 AbstractCegarLoop]: Abstraction has 3982 states and 8172 transitions. [2021-08-06 14:00:07,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 8172 transitions. [2021-08-06 14:00:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:07,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:07,739 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:07,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-06 14:00:07,739 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:07,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1682983675, now seen corresponding path program 27 times [2021-08-06 14:00:07,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:07,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481050714] [2021-08-06 14:00:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:07,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:08,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:08,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481050714] [2021-08-06 14:00:08,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481050714] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:08,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:08,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:00:08,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67087221] [2021-08-06 14:00:08,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:00:08,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:00:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:00:08,906 INFO L87 Difference]: Start difference. First operand 3982 states and 8172 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:15,251 INFO L93 Difference]: Finished difference Result 5949 states and 12223 transitions. [2021-08-06 14:00:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:00:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:15,259 INFO L225 Difference]: With dead ends: 5949 [2021-08-06 14:00:15,259 INFO L226 Difference]: Without dead ends: 5949 [2021-08-06 14:00:15,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 5055.2ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:00:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2021-08-06 14:00:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3980. [2021-08-06 14:00:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3977 states have (on average 2.053809404073422) internal successors, (8168), 3979 states have internal predecessors, (8168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 8168 transitions. [2021-08-06 14:00:15,309 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 8168 transitions. Word has length 88 [2021-08-06 14:00:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:15,310 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 8168 transitions. [2021-08-06 14:00:15,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 8168 transitions. [2021-08-06 14:00:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:15,313 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:15,313 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:15,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-06 14:00:15,313 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1044781387, now seen corresponding path program 28 times [2021-08-06 14:00:15,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:15,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271529404] [2021-08-06 14:00:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:15,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:16,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:16,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271529404] [2021-08-06 14:00:16,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271529404] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:16,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:16,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:00:16,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376460935] [2021-08-06 14:00:16,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:00:16,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:16,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:00:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:00:16,422 INFO L87 Difference]: Start difference. First operand 3980 states and 8168 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:22,947 INFO L93 Difference]: Finished difference Result 5988 states and 12316 transitions. [2021-08-06 14:00:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:00:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:22,954 INFO L225 Difference]: With dead ends: 5988 [2021-08-06 14:00:22,954 INFO L226 Difference]: Without dead ends: 5988 [2021-08-06 14:00:22,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4992.8ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:00:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2021-08-06 14:00:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3964. [2021-08-06 14:00:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3961 states have (on average 2.053521837919717) internal successors, (8134), 3963 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 8134 transitions. [2021-08-06 14:00:23,003 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 8134 transitions. Word has length 88 [2021-08-06 14:00:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:23,003 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 8134 transitions. [2021-08-06 14:00:23,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 8134 transitions. [2021-08-06 14:00:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:23,006 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:23,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:23,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-06 14:00:23,006 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash -710586795, now seen corresponding path program 29 times [2021-08-06 14:00:23,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:23,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436383514] [2021-08-06 14:00:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:23,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:24,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:24,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436383514] [2021-08-06 14:00:24,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436383514] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:24,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:24,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:00:24,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614109535] [2021-08-06 14:00:24,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:00:24,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:00:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:00:24,185 INFO L87 Difference]: Start difference. First operand 3964 states and 8134 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:30,337 INFO L93 Difference]: Finished difference Result 6123 states and 12601 transitions. [2021-08-06 14:00:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:00:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:30,345 INFO L225 Difference]: With dead ends: 6123 [2021-08-06 14:00:30,345 INFO L226 Difference]: Without dead ends: 6123 [2021-08-06 14:00:30,345 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4613.8ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:00:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2021-08-06 14:00:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 3962. [2021-08-06 14:00:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-06 14:00:30,396 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-06 14:00:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:30,397 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-06 14:00:30,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-06 14:00:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:30,400 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:30,400 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:30,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-06 14:00:30,400 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1104925599, now seen corresponding path program 30 times [2021-08-06 14:00:30,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:30,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005677960] [2021-08-06 14:00:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:30,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:31,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:31,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005677960] [2021-08-06 14:00:31,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005677960] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:31,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:31,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:00:31,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021951039] [2021-08-06 14:00:31,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:00:31,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:31,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:00:31,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:00:31,570 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:37,698 INFO L93 Difference]: Finished difference Result 6168 states and 12691 transitions. [2021-08-06 14:00:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:00:37,698 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:37,705 INFO L225 Difference]: With dead ends: 6168 [2021-08-06 14:00:37,705 INFO L226 Difference]: Without dead ends: 6168 [2021-08-06 14:00:37,706 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4674.0ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:00:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2021-08-06 14:00:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 3958. [2021-08-06 14:00:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3955 states have (on average 2.0536030341340075) internal successors, (8122), 3957 states have internal predecessors, (8122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 8122 transitions. [2021-08-06 14:00:37,765 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 8122 transitions. Word has length 88 [2021-08-06 14:00:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:37,766 INFO L470 AbstractCegarLoop]: Abstraction has 3958 states and 8122 transitions. [2021-08-06 14:00:37,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 8122 transitions. [2021-08-06 14:00:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:37,769 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:37,769 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:37,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-06 14:00:37,769 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:37,769 INFO L82 PathProgramCache]: Analyzing trace with hash 614466817, now seen corresponding path program 31 times [2021-08-06 14:00:37,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:37,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054457590] [2021-08-06 14:00:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:37,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:38,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:38,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054457590] [2021-08-06 14:00:38,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054457590] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:38,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:38,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:00:38,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209955618] [2021-08-06 14:00:38,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:00:38,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:38,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:00:38,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:00:38,913 INFO L87 Difference]: Start difference. First operand 3958 states and 8122 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:44,696 INFO L93 Difference]: Finished difference Result 5814 states and 11951 transitions. [2021-08-06 14:00:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:00:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:44,704 INFO L225 Difference]: With dead ends: 5814 [2021-08-06 14:00:44,704 INFO L226 Difference]: Without dead ends: 5814 [2021-08-06 14:00:44,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4485.4ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:00:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2021-08-06 14:00:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 3954. [2021-08-06 14:00:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 14:00:44,757 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 14:00:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:44,758 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 14:00:44,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 14:00:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:44,761 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:44,761 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:44,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-06 14:00:44,761 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:44,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:44,762 INFO L82 PathProgramCache]: Analyzing trace with hash -727982283, now seen corresponding path program 32 times [2021-08-06 14:00:44,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:44,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725974496] [2021-08-06 14:00:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:44,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:45,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:45,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725974496] [2021-08-06 14:00:45,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725974496] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:45,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:45,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:00:45,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998056216] [2021-08-06 14:00:45,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:00:45,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:00:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:00:45,897 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:52,290 INFO L93 Difference]: Finished difference Result 6722 states and 13826 transitions. [2021-08-06 14:00:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:00:52,290 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:52,298 INFO L225 Difference]: With dead ends: 6722 [2021-08-06 14:00:52,298 INFO L226 Difference]: Without dead ends: 6722 [2021-08-06 14:00:52,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4895.3ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:00:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2021-08-06 14:00:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 3984. [2021-08-06 14:00:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3981 states have (on average 2.0537553378548106) internal successors, (8176), 3983 states have internal predecessors, (8176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 8176 transitions. [2021-08-06 14:00:52,349 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 8176 transitions. Word has length 88 [2021-08-06 14:00:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:52,349 INFO L470 AbstractCegarLoop]: Abstraction has 3984 states and 8176 transitions. [2021-08-06 14:00:52,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 8176 transitions. [2021-08-06 14:00:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:52,352 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:52,352 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:52,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-06 14:00:52,352 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1241495701, now seen corresponding path program 33 times [2021-08-06 14:00:52,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:52,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222376387] [2021-08-06 14:00:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:52,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:53,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:53,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222376387] [2021-08-06 14:00:53,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222376387] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:53,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:53,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:00:53,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769785769] [2021-08-06 14:00:53,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:00:53,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:00:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:00:53,512 INFO L87 Difference]: Start difference. First operand 3984 states and 8176 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:59,570 INFO L93 Difference]: Finished difference Result 6000 states and 12325 transitions. [2021-08-06 14:00:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:00:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:00:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:59,577 INFO L225 Difference]: With dead ends: 6000 [2021-08-06 14:00:59,577 INFO L226 Difference]: Without dead ends: 6000 [2021-08-06 14:00:59,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4845.2ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:00:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2021-08-06 14:00:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3982. [2021-08-06 14:00:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3979 states have (on average 2.053782357376225) internal successors, (8172), 3981 states have internal predecessors, (8172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 8172 transitions. [2021-08-06 14:00:59,622 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 8172 transitions. Word has length 88 [2021-08-06 14:00:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:59,622 INFO L470 AbstractCegarLoop]: Abstraction has 3982 states and 8172 transitions. [2021-08-06 14:00:59,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 8172 transitions. [2021-08-06 14:00:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:00:59,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:59,625 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:59,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-06 14:00:59,625 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:00:59,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1879697989, now seen corresponding path program 34 times [2021-08-06 14:00:59,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:59,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149214937] [2021-08-06 14:00:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:59,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:00,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:00,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149214937] [2021-08-06 14:01:00,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149214937] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:00,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:00,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:01:00,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286678266] [2021-08-06 14:01:00,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:01:00,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:00,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:01:00,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:01:00,729 INFO L87 Difference]: Start difference. First operand 3982 states and 8172 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:07,205 INFO L93 Difference]: Finished difference Result 6039 states and 12418 transitions. [2021-08-06 14:01:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:01:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:07,213 INFO L225 Difference]: With dead ends: 6039 [2021-08-06 14:01:07,213 INFO L226 Difference]: Without dead ends: 6039 [2021-08-06 14:01:07,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 5077.6ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:01:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2021-08-06 14:01:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 3966. [2021-08-06 14:01:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-06 14:01:07,273 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-06 14:01:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:07,273 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-06 14:01:07,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-06 14:01:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:07,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:07,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:07,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-06 14:01:07,277 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash 659901125, now seen corresponding path program 35 times [2021-08-06 14:01:07,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:07,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086118631] [2021-08-06 14:01:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:07,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:08,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:08,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086118631] [2021-08-06 14:01:08,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086118631] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:08,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:08,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:01:08,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567001709] [2021-08-06 14:01:08,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:01:08,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:08,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:01:08,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:01:08,468 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:14,430 INFO L93 Difference]: Finished difference Result 6174 states and 12703 transitions. [2021-08-06 14:01:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:01:14,431 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:14,437 INFO L225 Difference]: With dead ends: 6174 [2021-08-06 14:01:14,437 INFO L226 Difference]: Without dead ends: 6174 [2021-08-06 14:01:14,437 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4562.3ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:01:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2021-08-06 14:01:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 3964. [2021-08-06 14:01:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3961 states have (on average 2.053521837919717) internal successors, (8134), 3963 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 8134 transitions. [2021-08-06 14:01:14,485 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 8134 transitions. Word has length 88 [2021-08-06 14:01:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:14,485 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 8134 transitions. [2021-08-06 14:01:14,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 8134 transitions. [2021-08-06 14:01:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:14,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:14,489 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:14,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-06 14:01:14,489 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:14,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1819553777, now seen corresponding path program 36 times [2021-08-06 14:01:14,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:14,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432355560] [2021-08-06 14:01:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:14,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:15,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:15,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432355560] [2021-08-06 14:01:15,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432355560] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:15,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:15,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:01:15,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540950251] [2021-08-06 14:01:15,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:01:15,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:01:15,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:01:15,653 INFO L87 Difference]: Start difference. First operand 3964 states and 8134 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:21,670 INFO L93 Difference]: Finished difference Result 6219 states and 12793 transitions. [2021-08-06 14:01:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:01:21,671 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:21,677 INFO L225 Difference]: With dead ends: 6219 [2021-08-06 14:01:21,678 INFO L226 Difference]: Without dead ends: 6219 [2021-08-06 14:01:21,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4514.8ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:01:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2021-08-06 14:01:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 3960. [2021-08-06 14:01:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3957 states have (on average 2.0535759413697243) internal successors, (8126), 3959 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 8126 transitions. [2021-08-06 14:01:21,724 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 8126 transitions. Word has length 88 [2021-08-06 14:01:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:21,724 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 8126 transitions. [2021-08-06 14:01:21,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 8126 transitions. [2021-08-06 14:01:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:21,727 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:21,727 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:21,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-06 14:01:21,727 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1984954737, now seen corresponding path program 37 times [2021-08-06 14:01:21,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:21,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503063911] [2021-08-06 14:01:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:21,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:22,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:22,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503063911] [2021-08-06 14:01:22,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503063911] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:22,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:22,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:01:22,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365780940] [2021-08-06 14:01:22,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:01:22,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:22,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:01:22,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:01:22,870 INFO L87 Difference]: Start difference. First operand 3960 states and 8126 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:29,087 INFO L93 Difference]: Finished difference Result 6279 states and 12913 transitions. [2021-08-06 14:01:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:01:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:29,093 INFO L225 Difference]: With dead ends: 6279 [2021-08-06 14:01:29,094 INFO L226 Difference]: Without dead ends: 6279 [2021-08-06 14:01:29,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4649.4ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:01:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2021-08-06 14:01:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3956. [2021-08-06 14:01:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-06 14:01:29,140 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-06 14:01:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:29,140 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-06 14:01:29,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-06 14:01:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:29,143 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:29,143 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:29,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-06 14:01:29,143 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:29,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1728908081, now seen corresponding path program 38 times [2021-08-06 14:01:29,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:29,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464704135] [2021-08-06 14:01:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:29,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:30,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:30,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464704135] [2021-08-06 14:01:30,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464704135] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:30,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:30,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:01:30,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314229593] [2021-08-06 14:01:30,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:01:30,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:01:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:01:30,337 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:36,214 INFO L93 Difference]: Finished difference Result 5861 states and 12045 transitions. [2021-08-06 14:01:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:01:36,215 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:36,221 INFO L225 Difference]: With dead ends: 5861 [2021-08-06 14:01:36,221 INFO L226 Difference]: Without dead ends: 5861 [2021-08-06 14:01:36,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4576.0ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:01:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5861 states. [2021-08-06 14:01:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5861 to 3954. [2021-08-06 14:01:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 14:01:36,265 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 14:01:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:36,265 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 14:01:36,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 14:01:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:36,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:36,268 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:36,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-06 14:01:36,268 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1537473473, now seen corresponding path program 39 times [2021-08-06 14:01:36,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:36,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672471206] [2021-08-06 14:01:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:36,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:37,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:37,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672471206] [2021-08-06 14:01:37,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672471206] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:37,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:37,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:01:37,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752278420] [2021-08-06 14:01:37,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:01:37,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:37,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:01:37,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:01:37,357 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:43,642 INFO L93 Difference]: Finished difference Result 6756 states and 13894 transitions. [2021-08-06 14:01:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:01:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:43,650 INFO L225 Difference]: With dead ends: 6756 [2021-08-06 14:01:43,651 INFO L226 Difference]: Without dead ends: 6756 [2021-08-06 14:01:43,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4815.7ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:01:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2021-08-06 14:01:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 3986. [2021-08-06 14:01:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 3983 states have (on average 2.0537283454682402) internal successors, (8180), 3985 states have internal predecessors, (8180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 8180 transitions. [2021-08-06 14:01:43,701 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 8180 transitions. Word has length 88 [2021-08-06 14:01:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:43,701 INFO L470 AbstractCegarLoop]: Abstraction has 3986 states and 8180 transitions. [2021-08-06 14:01:43,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 8180 transitions. [2021-08-06 14:01:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:43,704 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:43,704 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:43,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-06 14:01:43,704 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1023960055, now seen corresponding path program 40 times [2021-08-06 14:01:43,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:43,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810209229] [2021-08-06 14:01:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:43,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:44,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:44,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810209229] [2021-08-06 14:01:44,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810209229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:44,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:44,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:01:44,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642628837] [2021-08-06 14:01:44,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:01:44,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:44,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:01:44,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:01:44,760 INFO L87 Difference]: Start difference. First operand 3986 states and 8180 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:51,037 INFO L93 Difference]: Finished difference Result 6034 states and 12393 transitions. [2021-08-06 14:01:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:01:51,038 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:51,044 INFO L225 Difference]: With dead ends: 6034 [2021-08-06 14:01:51,044 INFO L226 Difference]: Without dead ends: 6034 [2021-08-06 14:01:51,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4826.9ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:01:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2021-08-06 14:01:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3984. [2021-08-06 14:01:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3981 states have (on average 2.0537553378548106) internal successors, (8176), 3983 states have internal predecessors, (8176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 8176 transitions. [2021-08-06 14:01:51,087 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 8176 transitions. Word has length 88 [2021-08-06 14:01:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:51,087 INFO L470 AbstractCegarLoop]: Abstraction has 3984 states and 8176 transitions. [2021-08-06 14:01:51,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 8176 transitions. [2021-08-06 14:01:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:51,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:51,090 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:51,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-06 14:01:51,090 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:51,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash 385757767, now seen corresponding path program 41 times [2021-08-06 14:01:51,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:51,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415362747] [2021-08-06 14:01:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:51,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:52,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:52,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415362747] [2021-08-06 14:01:52,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415362747] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:52,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:52,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:01:52,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591522114] [2021-08-06 14:01:52,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:01:52,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:01:52,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:01:52,119 INFO L87 Difference]: Start difference. First operand 3984 states and 8176 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:58,766 INFO L93 Difference]: Finished difference Result 6073 states and 12486 transitions. [2021-08-06 14:01:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:01:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:01:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:58,773 INFO L225 Difference]: With dead ends: 6073 [2021-08-06 14:01:58,774 INFO L226 Difference]: Without dead ends: 6073 [2021-08-06 14:01:58,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4993.3ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:01:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2021-08-06 14:01:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3968. [2021-08-06 14:01:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3965 states have (on average 2.053467843631778) internal successors, (8142), 3967 states have internal predecessors, (8142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 8142 transitions. [2021-08-06 14:01:58,824 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 8142 transitions. Word has length 88 [2021-08-06 14:01:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:58,824 INFO L470 AbstractCegarLoop]: Abstraction has 3968 states and 8142 transitions. [2021-08-06 14:01:58,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 8142 transitions. [2021-08-06 14:01:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:01:58,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:58,827 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:58,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-06 14:01:58,827 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:01:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1369610415, now seen corresponding path program 42 times [2021-08-06 14:01:58,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:58,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761215444] [2021-08-06 14:01:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:58,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:00,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:00,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761215444] [2021-08-06 14:02:00,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761215444] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:00,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:00,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:02:00,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906378170] [2021-08-06 14:02:00,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:02:00,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:02:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:02:00,045 INFO L87 Difference]: Start difference. First operand 3968 states and 8142 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:05,763 INFO L93 Difference]: Finished difference Result 6208 states and 12771 transitions. [2021-08-06 14:02:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:02:05,768 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:05,776 INFO L225 Difference]: With dead ends: 6208 [2021-08-06 14:02:05,776 INFO L226 Difference]: Without dead ends: 6208 [2021-08-06 14:02:05,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4559.1ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:02:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6208 states. [2021-08-06 14:02:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6208 to 3966. [2021-08-06 14:02:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-06 14:02:05,827 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-06 14:02:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:05,828 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-06 14:02:05,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-06 14:02:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:05,831 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:05,831 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:05,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-06 14:02:05,831 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash 445901979, now seen corresponding path program 43 times [2021-08-06 14:02:05,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:05,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490141079] [2021-08-06 14:02:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:05,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:06,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:06,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490141079] [2021-08-06 14:02:06,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490141079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:06,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:06,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:02:06,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162320293] [2021-08-06 14:02:06,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:02:06,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:02:06,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:02:06,983 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:12,719 INFO L93 Difference]: Finished difference Result 6253 states and 12861 transitions. [2021-08-06 14:02:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:02:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:12,727 INFO L225 Difference]: With dead ends: 6253 [2021-08-06 14:02:12,727 INFO L226 Difference]: Without dead ends: 6253 [2021-08-06 14:02:12,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4495.6ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:02:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2021-08-06 14:02:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 3962. [2021-08-06 14:02:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-06 14:02:12,791 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-06 14:02:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:12,791 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-06 14:02:12,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-06 14:02:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:12,794 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:12,794 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:12,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-06 14:02:12,795 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:12,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash -44556803, now seen corresponding path program 44 times [2021-08-06 14:02:12,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:12,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061907272] [2021-08-06 14:02:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:12,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:13,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:13,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061907272] [2021-08-06 14:02:13,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061907272] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:13,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:13,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:02:13,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726707694] [2021-08-06 14:02:13,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:02:13,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:13,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:02:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:02:13,957 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:19,716 INFO L93 Difference]: Finished difference Result 6313 states and 12981 transitions. [2021-08-06 14:02:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:02:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:19,723 INFO L225 Difference]: With dead ends: 6313 [2021-08-06 14:02:19,723 INFO L226 Difference]: Without dead ends: 6313 [2021-08-06 14:02:19,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4378.5ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:02:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2021-08-06 14:02:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 3958. [2021-08-06 14:02:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3955 states have (on average 2.0536030341340075) internal successors, (8122), 3957 states have internal predecessors, (8122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 8122 transitions. [2021-08-06 14:02:19,772 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 8122 transitions. Word has length 88 [2021-08-06 14:02:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:19,772 INFO L470 AbstractCegarLoop]: Abstraction has 3958 states and 8122 transitions. [2021-08-06 14:02:19,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 8122 transitions. [2021-08-06 14:02:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:19,775 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:19,775 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:19,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-06 14:02:19,776 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash -300603459, now seen corresponding path program 45 times [2021-08-06 14:02:19,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:19,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59777675] [2021-08-06 14:02:19,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:19,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:20,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:20,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59777675] [2021-08-06 14:02:20,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59777675] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:20,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:20,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:02:20,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263046201] [2021-08-06 14:02:20,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:02:20,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:02:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:02:20,924 INFO L87 Difference]: Start difference. First operand 3958 states and 8122 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:26,658 INFO L93 Difference]: Finished difference Result 6358 states and 13071 transitions. [2021-08-06 14:02:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:02:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:26,670 INFO L225 Difference]: With dead ends: 6358 [2021-08-06 14:02:26,671 INFO L226 Difference]: Without dead ends: 6358 [2021-08-06 14:02:26,671 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4368.7ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:02:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2021-08-06 14:02:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 3956. [2021-08-06 14:02:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-06 14:02:26,722 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-06 14:02:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:26,722 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-06 14:02:26,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-06 14:02:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:26,725 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:26,725 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:26,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-06 14:02:26,726 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:26,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash 164374939, now seen corresponding path program 46 times [2021-08-06 14:02:26,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:26,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638870154] [2021-08-06 14:02:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:26,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:27,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:27,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638870154] [2021-08-06 14:02:27,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638870154] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:27,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:27,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:02:27,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39346814] [2021-08-06 14:02:27,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:02:27,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:02:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:02:27,872 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:33,389 INFO L93 Difference]: Finished difference Result 5893 states and 12109 transitions. [2021-08-06 14:02:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:02:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:33,397 INFO L225 Difference]: With dead ends: 5893 [2021-08-06 14:02:33,397 INFO L226 Difference]: Without dead ends: 5893 [2021-08-06 14:02:33,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4353.1ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:02:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2021-08-06 14:02:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 3954. [2021-08-06 14:02:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 14:02:33,448 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 14:02:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:33,449 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 14:02:33,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 14:02:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:33,452 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:33,452 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:33,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-06 14:02:33,452 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1642866739, now seen corresponding path program 47 times [2021-08-06 14:02:33,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:33,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448205115] [2021-08-06 14:02:33,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:33,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:34,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:34,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448205115] [2021-08-06 14:02:34,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448205115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:34,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:34,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:02:34,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979517921] [2021-08-06 14:02:34,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:02:34,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:02:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:02:34,497 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:40,519 INFO L93 Difference]: Finished difference Result 6501 states and 13367 transitions. [2021-08-06 14:02:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:02:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:40,527 INFO L225 Difference]: With dead ends: 6501 [2021-08-06 14:02:40,527 INFO L226 Difference]: Without dead ends: 6501 [2021-08-06 14:02:40,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4718.1ms TimeCoverageRelationStatistics Valid=1184, Invalid=5458, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:02:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2021-08-06 14:02:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 3992. [2021-08-06 14:02:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3992 states, 3989 states have (on average 2.053647530709451) internal successors, (8192), 3991 states have internal predecessors, (8192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 8192 transitions. [2021-08-06 14:02:40,574 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 8192 transitions. Word has length 88 [2021-08-06 14:02:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:40,574 INFO L470 AbstractCegarLoop]: Abstraction has 3992 states and 8192 transitions. [2021-08-06 14:02:40,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 8192 transitions. [2021-08-06 14:02:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:40,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:40,577 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:40,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-06 14:02:40,577 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2138587139, now seen corresponding path program 48 times [2021-08-06 14:02:40,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:40,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138803304] [2021-08-06 14:02:40,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:40,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:41,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:41,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138803304] [2021-08-06 14:02:41,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138803304] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:41,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:41,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:02:41,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055558980] [2021-08-06 14:02:41,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:02:41,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:41,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:02:41,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:02:41,653 INFO L87 Difference]: Start difference. First operand 3992 states and 8192 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:47,588 INFO L93 Difference]: Finished difference Result 5779 states and 11866 transitions. [2021-08-06 14:02:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:02:47,588 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:47,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:47,595 INFO L225 Difference]: With dead ends: 5779 [2021-08-06 14:02:47,595 INFO L226 Difference]: Without dead ends: 5779 [2021-08-06 14:02:47,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4722.3ms TimeCoverageRelationStatistics Valid=1051, Invalid=4955, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:02:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2021-08-06 14:02:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 3990. [2021-08-06 14:02:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3987 states have (on average 2.053674441936293) internal successors, (8188), 3989 states have internal predecessors, (8188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 8188 transitions. [2021-08-06 14:02:47,645 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 8188 transitions. Word has length 88 [2021-08-06 14:02:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:47,645 INFO L470 AbstractCegarLoop]: Abstraction has 3990 states and 8188 transitions. [2021-08-06 14:02:47,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 8188 transitions. [2021-08-06 14:02:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:47,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:47,649 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:47,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-06 14:02:47,649 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1500384851, now seen corresponding path program 49 times [2021-08-06 14:02:47,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:47,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79678521] [2021-08-06 14:02:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:47,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:48,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:48,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79678521] [2021-08-06 14:02:48,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79678521] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:48,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:48,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:02:48,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369739647] [2021-08-06 14:02:48,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:02:48,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:02:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:02:48,745 INFO L87 Difference]: Start difference. First operand 3990 states and 8188 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:55,018 INFO L93 Difference]: Finished difference Result 5818 states and 11959 transitions. [2021-08-06 14:02:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:02:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:02:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:55,024 INFO L225 Difference]: With dead ends: 5818 [2021-08-06 14:02:55,025 INFO L226 Difference]: Without dead ends: 5818 [2021-08-06 14:02:55,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4863.7ms TimeCoverageRelationStatistics Valid=1094, Invalid=5068, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:02:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2021-08-06 14:02:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 3974. [2021-08-06 14:02:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3971 states have (on average 2.0533870561571392) internal successors, (8154), 3973 states have internal predecessors, (8154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 8154 transitions. [2021-08-06 14:02:55,067 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 8154 transitions. Word has length 88 [2021-08-06 14:02:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:55,067 INFO L470 AbstractCegarLoop]: Abstraction has 3974 states and 8154 transitions. [2021-08-06 14:02:55,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 8154 transitions. [2021-08-06 14:02:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:02:55,070 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:55,070 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:55,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-06 14:02:55,070 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:02:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash -254983331, now seen corresponding path program 50 times [2021-08-06 14:02:55,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:55,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860950129] [2021-08-06 14:02:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:55,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:56,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:56,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860950129] [2021-08-06 14:02:56,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860950129] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:56,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:56,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:02:56,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099612801] [2021-08-06 14:02:56,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:02:56,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:02:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:02:56,213 INFO L87 Difference]: Start difference. First operand 3974 states and 8154 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:01,997 INFO L93 Difference]: Finished difference Result 5953 states and 12244 transitions. [2021-08-06 14:03:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:03:01,998 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:02,004 INFO L225 Difference]: With dead ends: 5953 [2021-08-06 14:03:02,004 INFO L226 Difference]: Without dead ends: 5953 [2021-08-06 14:03:02,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4368.0ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:03:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2021-08-06 14:03:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3972. [2021-08-06 14:03:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3969 states have (on average 2.053413958175863) internal successors, (8150), 3971 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 8150 transitions. [2021-08-06 14:03:02,051 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 8150 transitions. Word has length 88 [2021-08-06 14:03:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:02,051 INFO L470 AbstractCegarLoop]: Abstraction has 3972 states and 8150 transitions. [2021-08-06 14:03:02,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 8150 transitions. [2021-08-06 14:03:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:02,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:02,054 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:02,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-06 14:03:02,055 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1560529063, now seen corresponding path program 51 times [2021-08-06 14:03:02,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:02,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797044766] [2021-08-06 14:03:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:02,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:03,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:03,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797044766] [2021-08-06 14:03:03,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797044766] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:03,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:03,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:03:03,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822938804] [2021-08-06 14:03:03,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:03:03,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:03:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:03:03,234 INFO L87 Difference]: Start difference. First operand 3972 states and 8150 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:08,980 INFO L93 Difference]: Finished difference Result 5998 states and 12334 transitions. [2021-08-06 14:03:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:03:08,981 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:08,987 INFO L225 Difference]: With dead ends: 5998 [2021-08-06 14:03:08,987 INFO L226 Difference]: Without dead ends: 5998 [2021-08-06 14:03:08,987 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4376.5ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:03:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2021-08-06 14:03:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3968. [2021-08-06 14:03:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3965 states have (on average 2.053467843631778) internal successors, (8142), 3967 states have internal predecessors, (8142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 8142 transitions. [2021-08-06 14:03:09,029 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 8142 transitions. Word has length 88 [2021-08-06 14:03:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:09,029 INFO L470 AbstractCegarLoop]: Abstraction has 3968 states and 8142 transitions. [2021-08-06 14:03:09,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 8142 transitions. [2021-08-06 14:03:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:09,032 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:09,032 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:09,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-06 14:03:09,032 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1070070281, now seen corresponding path program 52 times [2021-08-06 14:03:09,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:09,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862349979] [2021-08-06 14:03:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:09,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:10,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:10,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862349979] [2021-08-06 14:03:10,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862349979] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:10,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:10,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:03:10,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048872671] [2021-08-06 14:03:10,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:03:10,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:03:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:03:10,167 INFO L87 Difference]: Start difference. First operand 3968 states and 8142 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:16,129 INFO L93 Difference]: Finished difference Result 6058 states and 12454 transitions. [2021-08-06 14:03:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:03:16,129 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:16,135 INFO L225 Difference]: With dead ends: 6058 [2021-08-06 14:03:16,135 INFO L226 Difference]: Without dead ends: 6058 [2021-08-06 14:03:16,136 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4329.2ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:03:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2021-08-06 14:03:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3964. [2021-08-06 14:03:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3961 states have (on average 2.053521837919717) internal successors, (8134), 3963 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 8134 transitions. [2021-08-06 14:03:16,182 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 8134 transitions. Word has length 88 [2021-08-06 14:03:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:16,182 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 8134 transitions. [2021-08-06 14:03:16,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 8134 transitions. [2021-08-06 14:03:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:16,185 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:16,185 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:16,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-06 14:03:16,185 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash 814023625, now seen corresponding path program 53 times [2021-08-06 14:03:16,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:16,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819768085] [2021-08-06 14:03:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:16,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:17,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:17,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819768085] [2021-08-06 14:03:17,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819768085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:17,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:17,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:03:17,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527244047] [2021-08-06 14:03:17,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:03:17,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:17,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:03:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:03:17,324 INFO L87 Difference]: Start difference. First operand 3964 states and 8134 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:22,887 INFO L93 Difference]: Finished difference Result 6103 states and 12544 transitions. [2021-08-06 14:03:22,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:03:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:22,894 INFO L225 Difference]: With dead ends: 6103 [2021-08-06 14:03:22,894 INFO L226 Difference]: Without dead ends: 6103 [2021-08-06 14:03:22,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4316.8ms TimeCoverageRelationStatistics Valid=1071, Invalid=5091, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:03:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2021-08-06 14:03:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 3962. [2021-08-06 14:03:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-06 14:03:22,941 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-06 14:03:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:22,941 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-06 14:03:22,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-06 14:03:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:22,944 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:22,944 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:22,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-06 14:03:22,944 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1279002023, now seen corresponding path program 54 times [2021-08-06 14:03:22,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:22,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089290915] [2021-08-06 14:03:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:22,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:24,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:24,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089290915] [2021-08-06 14:03:24,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089290915] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:24,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:24,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:03:24,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707351326] [2021-08-06 14:03:24,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:03:24,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:24,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:03:24,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:03:24,092 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:29,577 INFO L93 Difference]: Finished difference Result 6133 states and 12604 transitions. [2021-08-06 14:03:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:03:29,577 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:29,584 INFO L225 Difference]: With dead ends: 6133 [2021-08-06 14:03:29,584 INFO L226 Difference]: Without dead ends: 6133 [2021-08-06 14:03:29,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4316.8ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:03:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-08-06 14:03:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 3960. [2021-08-06 14:03:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3957 states have (on average 2.0535759413697243) internal successors, (8126), 3959 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 8126 transitions. [2021-08-06 14:03:29,630 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 8126 transitions. Word has length 88 [2021-08-06 14:03:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:29,630 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 8126 transitions. [2021-08-06 14:03:29,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 8126 transitions. [2021-08-06 14:03:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:29,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:29,633 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:29,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-06 14:03:29,633 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1446059383, now seen corresponding path program 55 times [2021-08-06 14:03:29,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:29,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87972740] [2021-08-06 14:03:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:29,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:30,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:30,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87972740] [2021-08-06 14:03:30,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87972740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:30,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:30,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:03:30,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543255987] [2021-08-06 14:03:30,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:03:30,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:30,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:03:30,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:03:30,785 INFO L87 Difference]: Start difference. First operand 3960 states and 8126 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:36,537 INFO L93 Difference]: Finished difference Result 5636 states and 11578 transitions. [2021-08-06 14:03:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:03:36,537 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:36,543 INFO L225 Difference]: With dead ends: 5636 [2021-08-06 14:03:36,543 INFO L226 Difference]: Without dead ends: 5636 [2021-08-06 14:03:36,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4306.7ms TimeCoverageRelationStatistics Valid=1070, Invalid=5092, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:03:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2021-08-06 14:03:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 3954. [2021-08-06 14:03:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 14:03:36,591 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 14:03:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:36,591 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 14:03:36,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 14:03:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:36,594 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:36,594 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:36,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-06 14:03:36,594 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:36,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1008395733, now seen corresponding path program 56 times [2021-08-06 14:03:36,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:36,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011472810] [2021-08-06 14:03:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:36,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:37,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:37,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011472810] [2021-08-06 14:03:37,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011472810] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:37,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:37,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:03:37,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134242529] [2021-08-06 14:03:37,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:03:37,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:03:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:03:37,683 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:43,903 INFO L93 Difference]: Finished difference Result 6292 states and 12950 transitions. [2021-08-06 14:03:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:03:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:43,910 INFO L225 Difference]: With dead ends: 6292 [2021-08-06 14:03:43,910 INFO L226 Difference]: Without dead ends: 6292 [2021-08-06 14:03:43,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4798.9ms TimeCoverageRelationStatistics Valid=1183, Invalid=5459, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:03:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6292 states. [2021-08-06 14:03:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6292 to 3980. [2021-08-06 14:03:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3977 states have (on average 2.053809404073422) internal successors, (8168), 3979 states have internal predecessors, (8168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 8168 transitions. [2021-08-06 14:03:43,956 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 8168 transitions. Word has length 88 [2021-08-06 14:03:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:43,956 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 8168 transitions. [2021-08-06 14:03:43,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 8168 transitions. [2021-08-06 14:03:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:43,959 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:43,959 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:43,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-06 14:03:43,960 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash 494882315, now seen corresponding path program 57 times [2021-08-06 14:03:43,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:43,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586528495] [2021-08-06 14:03:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:43,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:45,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:45,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586528495] [2021-08-06 14:03:45,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586528495] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:45,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:45,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:03:45,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563261241] [2021-08-06 14:03:45,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:03:45,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:45,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:03:45,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:03:45,036 INFO L87 Difference]: Start difference. First operand 3980 states and 8168 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:51,178 INFO L93 Difference]: Finished difference Result 5570 states and 11449 transitions. [2021-08-06 14:03:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:03:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:51,185 INFO L225 Difference]: With dead ends: 5570 [2021-08-06 14:03:51,185 INFO L226 Difference]: Without dead ends: 5570 [2021-08-06 14:03:51,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 4785.9ms TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:03:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2021-08-06 14:03:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3978. [2021-08-06 14:03:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3975 states have (on average 2.053836477987421) internal successors, (8164), 3977 states have internal predecessors, (8164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 8164 transitions. [2021-08-06 14:03:51,231 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 8164 transitions. Word has length 88 [2021-08-06 14:03:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:51,231 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 8164 transitions. [2021-08-06 14:03:51,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 8164 transitions. [2021-08-06 14:03:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:51,235 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:51,235 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:51,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-06 14:03:51,235 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:51,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash -143319973, now seen corresponding path program 58 times [2021-08-06 14:03:51,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:51,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274034277] [2021-08-06 14:03:51,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:51,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:52,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:52,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274034277] [2021-08-06 14:03:52,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274034277] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:52,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:52,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:03:52,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433733973] [2021-08-06 14:03:52,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:03:52,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:03:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:03:52,316 INFO L87 Difference]: Start difference. First operand 3978 states and 8164 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:58,424 INFO L93 Difference]: Finished difference Result 5609 states and 11542 transitions. [2021-08-06 14:03:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:03:58,424 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:03:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:58,430 INFO L225 Difference]: With dead ends: 5609 [2021-08-06 14:03:58,430 INFO L226 Difference]: Without dead ends: 5609 [2021-08-06 14:03:58,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 4936.4ms TimeCoverageRelationStatistics Valid=1093, Invalid=5069, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:03:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5609 states. [2021-08-06 14:03:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5609 to 3962. [2021-08-06 14:03:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0535488759787826) internal successors, (8130), 3961 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8130 transitions. [2021-08-06 14:03:58,475 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8130 transitions. Word has length 88 [2021-08-06 14:03:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:58,475 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8130 transitions. [2021-08-06 14:03:58,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8130 transitions. [2021-08-06 14:03:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:03:58,478 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:58,478 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:58,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-08-06 14:03:58,479 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:03:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1898688155, now seen corresponding path program 59 times [2021-08-06 14:03:58,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:58,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331691511] [2021-08-06 14:03:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:58,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:59,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:59,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331691511] [2021-08-06 14:03:59,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331691511] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:59,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:59,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:03:59,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991322946] [2021-08-06 14:03:59,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:03:59,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:59,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:03:59,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:03:59,626 INFO L87 Difference]: Start difference. First operand 3962 states and 8130 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:05,285 INFO L93 Difference]: Finished difference Result 5744 states and 11827 transitions. [2021-08-06 14:04:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:04:05,285 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:05,291 INFO L225 Difference]: With dead ends: 5744 [2021-08-06 14:04:05,291 INFO L226 Difference]: Without dead ends: 5744 [2021-08-06 14:04:05,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 4457.2ms TimeCoverageRelationStatistics Valid=1069, Invalid=5093, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:04:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2021-08-06 14:04:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 3960. [2021-08-06 14:04:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3957 states have (on average 2.0535759413697243) internal successors, (8126), 3959 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 8126 transitions. [2021-08-06 14:04:05,336 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 8126 transitions. Word has length 88 [2021-08-06 14:04:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:05,336 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 8126 transitions. [2021-08-06 14:04:05,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 8126 transitions. [2021-08-06 14:04:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:05,339 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:05,339 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:05,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-08-06 14:04:05,339 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:05,339 INFO L82 PathProgramCache]: Analyzing trace with hash -83175761, now seen corresponding path program 60 times [2021-08-06 14:04:05,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:05,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134569502] [2021-08-06 14:04:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:05,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:06,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:06,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134569502] [2021-08-06 14:04:06,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134569502] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:06,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:06,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:04:06,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974773733] [2021-08-06 14:04:06,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:04:06,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:04:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:04:06,496 INFO L87 Difference]: Start difference. First operand 3960 states and 8126 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:12,251 INFO L93 Difference]: Finished difference Result 5609 states and 11542 transitions. [2021-08-06 14:04:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:04:12,252 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:12,258 INFO L225 Difference]: With dead ends: 5609 [2021-08-06 14:04:12,258 INFO L226 Difference]: Without dead ends: 5609 [2021-08-06 14:04:12,258 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 4435.8ms TimeCoverageRelationStatistics Valid=1069, Invalid=5093, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:04:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5609 states. [2021-08-06 14:04:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5609 to 3956. [2021-08-06 14:04:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3953 states have (on average 2.05363015431318) internal successors, (8118), 3955 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 8118 transitions. [2021-08-06 14:04:12,305 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 8118 transitions. Word has length 88 [2021-08-06 14:04:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:12,305 INFO L470 AbstractCegarLoop]: Abstraction has 3956 states and 8118 transitions. [2021-08-06 14:04:12,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 8118 transitions. [2021-08-06 14:04:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:12,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:12,308 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:12,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-08-06 14:04:12,308 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash 88061973, now seen corresponding path program 61 times [2021-08-06 14:04:12,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:12,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434443475] [2021-08-06 14:04:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:12,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:13,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:13,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434443475] [2021-08-06 14:04:13,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434443475] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:13,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:13,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:04:13,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089312880] [2021-08-06 14:04:13,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:04:13,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:04:13,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:04:13,366 INFO L87 Difference]: Start difference. First operand 3956 states and 8118 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:19,913 INFO L93 Difference]: Finished difference Result 6642 states and 13685 transitions. [2021-08-06 14:04:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-06 14:04:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:19,919 INFO L225 Difference]: With dead ends: 6642 [2021-08-06 14:04:19,919 INFO L226 Difference]: Without dead ends: 6642 [2021-08-06 14:04:19,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 4905.5ms TimeCoverageRelationStatistics Valid=1220, Invalid=5586, Unknown=0, NotChecked=0, Total=6806 [2021-08-06 14:04:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6642 states. [2021-08-06 14:04:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6642 to 3983. [2021-08-06 14:04:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3980 states have (on average 2.0540201005025125) internal successors, (8175), 3982 states have internal predecessors, (8175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 8175 transitions. [2021-08-06 14:04:19,956 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 8175 transitions. Word has length 88 [2021-08-06 14:04:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:19,956 INFO L470 AbstractCegarLoop]: Abstraction has 3983 states and 8175 transitions. [2021-08-06 14:04:19,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 8175 transitions. [2021-08-06 14:04:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:19,959 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:19,959 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:19,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-08-06 14:04:19,959 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash -425451445, now seen corresponding path program 62 times [2021-08-06 14:04:19,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:19,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110167160] [2021-08-06 14:04:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:19,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:20,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:20,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110167160] [2021-08-06 14:04:20,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110167160] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:20,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:20,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:04:20,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559923048] [2021-08-06 14:04:20,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:04:20,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:04:20,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:04:20,985 INFO L87 Difference]: Start difference. First operand 3983 states and 8175 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:26,760 INFO L93 Difference]: Finished difference Result 5920 states and 12184 transitions. [2021-08-06 14:04:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:04:26,760 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:26,766 INFO L225 Difference]: With dead ends: 5920 [2021-08-06 14:04:26,766 INFO L226 Difference]: Without dead ends: 5920 [2021-08-06 14:04:26,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4488.2ms TimeCoverageRelationStatistics Valid=1087, Invalid=5075, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:04:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5920 states. [2021-08-06 14:04:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5920 to 3981. [2021-08-06 14:04:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3978 states have (on average 2.0540472599296127) internal successors, (8171), 3980 states have internal predecessors, (8171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 8171 transitions. [2021-08-06 14:04:26,802 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 8171 transitions. Word has length 88 [2021-08-06 14:04:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:26,802 INFO L470 AbstractCegarLoop]: Abstraction has 3981 states and 8171 transitions. [2021-08-06 14:04:26,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 8171 transitions. [2021-08-06 14:04:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:26,804 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:26,804 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:26,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-08-06 14:04:26,805 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:26,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1063653733, now seen corresponding path program 63 times [2021-08-06 14:04:26,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:26,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039403456] [2021-08-06 14:04:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:26,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:27,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:27,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039403456] [2021-08-06 14:04:27,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039403456] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:27,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:27,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:04:27,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228877214] [2021-08-06 14:04:27,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:04:27,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:04:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:04:27,853 INFO L87 Difference]: Start difference. First operand 3981 states and 8171 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:34,132 INFO L93 Difference]: Finished difference Result 5824 states and 11992 transitions. [2021-08-06 14:04:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:04:34,133 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:34,139 INFO L225 Difference]: With dead ends: 5824 [2021-08-06 14:04:34,140 INFO L226 Difference]: Without dead ends: 5824 [2021-08-06 14:04:34,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 4788.8ms TimeCoverageRelationStatistics Valid=1131, Invalid=5189, Unknown=0, NotChecked=0, Total=6320 [2021-08-06 14:04:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2021-08-06 14:04:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 3965. [2021-08-06 14:04:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3962 states have (on average 2.0537607269056033) internal successors, (8137), 3964 states have internal predecessors, (8137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 8137 transitions. [2021-08-06 14:04:34,191 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 8137 transitions. Word has length 88 [2021-08-06 14:04:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:34,192 INFO L470 AbstractCegarLoop]: Abstraction has 3965 states and 8137 transitions. [2021-08-06 14:04:34,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 8137 transitions. [2021-08-06 14:04:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:34,195 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:34,195 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:34,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-08-06 14:04:34,195 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1306427405, now seen corresponding path program 64 times [2021-08-06 14:04:34,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:34,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830755312] [2021-08-06 14:04:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:34,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:35,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:35,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830755312] [2021-08-06 14:04:35,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830755312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:35,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:35,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:04:35,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226334162] [2021-08-06 14:04:35,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:04:35,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:04:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:04:35,280 INFO L87 Difference]: Start difference. First operand 3965 states and 8137 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:41,985 INFO L93 Difference]: Finished difference Result 7383 states and 15210 transitions. [2021-08-06 14:04:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-06 14:04:41,985 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:41,995 INFO L225 Difference]: With dead ends: 7383 [2021-08-06 14:04:41,995 INFO L226 Difference]: Without dead ends: 7383 [2021-08-06 14:04:41,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 5343.0ms TimeCoverageRelationStatistics Valid=1305, Invalid=5835, Unknown=0, NotChecked=0, Total=7140 [2021-08-06 14:04:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2021-08-06 14:04:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 3966. [2021-08-06 14:04:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.0537471612414837) internal successors, (8139), 3965 states have internal predecessors, (8139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8139 transitions. [2021-08-06 14:04:42,053 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8139 transitions. Word has length 88 [2021-08-06 14:04:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:42,054 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8139 transitions. [2021-08-06 14:04:42,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8139 transitions. [2021-08-06 14:04:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:42,057 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:42,057 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:42,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-08-06 14:04:42,057 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash -635698263, now seen corresponding path program 65 times [2021-08-06 14:04:42,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:42,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704440019] [2021-08-06 14:04:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:42,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:43,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:43,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704440019] [2021-08-06 14:04:43,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704440019] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:43,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:43,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:04:43,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367862123] [2021-08-06 14:04:43,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:04:43,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:43,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:04:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:04:43,179 INFO L87 Difference]: Start difference. First operand 3966 states and 8139 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:49,386 INFO L93 Difference]: Finished difference Result 6611 states and 13606 transitions. [2021-08-06 14:04:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:04:49,387 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:49,395 INFO L225 Difference]: With dead ends: 6611 [2021-08-06 14:04:49,396 INFO L226 Difference]: Without dead ends: 6611 [2021-08-06 14:04:49,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 4806.2ms TimeCoverageRelationStatistics Valid=1177, Invalid=5465, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:04:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6611 states. [2021-08-06 14:04:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6611 to 3968. [2021-08-06 14:04:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3965 states have (on average 2.053720050441362) internal successors, (8143), 3967 states have internal predecessors, (8143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 8143 transitions. [2021-08-06 14:04:49,474 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 8143 transitions. Word has length 88 [2021-08-06 14:04:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:49,475 INFO L470 AbstractCegarLoop]: Abstraction has 3968 states and 8143 transitions. [2021-08-06 14:04:49,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 8143 transitions. [2021-08-06 14:04:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:49,477 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:49,477 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:49,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-08-06 14:04:49,477 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 600461801, now seen corresponding path program 66 times [2021-08-06 14:04:49,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:49,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103123031] [2021-08-06 14:04:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:49,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:50,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:50,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103123031] [2021-08-06 14:04:50,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103123031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:50,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:50,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:04:50,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825685300] [2021-08-06 14:04:50,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:04:50,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:04:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:04:50,502 INFO L87 Difference]: Start difference. First operand 3968 states and 8143 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:56,181 INFO L93 Difference]: Finished difference Result 5778 states and 11883 transitions. [2021-08-06 14:04:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:04:56,182 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:04:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:56,188 INFO L225 Difference]: With dead ends: 5778 [2021-08-06 14:04:56,188 INFO L226 Difference]: Without dead ends: 5778 [2021-08-06 14:04:56,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 4341.1ms TimeCoverageRelationStatistics Valid=1046, Invalid=4960, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:04:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2021-08-06 14:04:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 3957. [2021-08-06 14:04:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3957 states, 3954 states have (on average 2.0536165907941326) internal successors, (8120), 3956 states have internal predecessors, (8120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 8120 transitions. [2021-08-06 14:04:56,239 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 8120 transitions. Word has length 88 [2021-08-06 14:04:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:56,240 INFO L470 AbstractCegarLoop]: Abstraction has 3957 states and 8120 transitions. [2021-08-06 14:04:56,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 8120 transitions. [2021-08-06 14:04:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:04:56,243 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:56,243 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:56,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-08-06 14:04:56,243 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:04:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash 536592695, now seen corresponding path program 67 times [2021-08-06 14:04:56,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:56,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402272081] [2021-08-06 14:04:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:56,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:57,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:57,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402272081] [2021-08-06 14:04:57,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402272081] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:57,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:57,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:04:57,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048702263] [2021-08-06 14:04:57,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:04:57,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:04:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:04:57,332 INFO L87 Difference]: Start difference. First operand 3957 states and 8120 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:03,935 INFO L93 Difference]: Finished difference Result 6625 states and 13651 transitions. [2021-08-06 14:05:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:05:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:03,944 INFO L225 Difference]: With dead ends: 6625 [2021-08-06 14:05:03,944 INFO L226 Difference]: Without dead ends: 6625 [2021-08-06 14:05:03,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4924.9ms TimeCoverageRelationStatistics Valid=1183, Invalid=5459, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:05:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2021-08-06 14:05:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 3977. [2021-08-06 14:05:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3974 states have (on average 2.053850025163563) internal successors, (8162), 3976 states have internal predecessors, (8162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 8162 transitions. [2021-08-06 14:05:03,991 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 8162 transitions. Word has length 88 [2021-08-06 14:05:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:03,991 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 8162 transitions. [2021-08-06 14:05:03,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 8162 transitions. [2021-08-06 14:05:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:03,993 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:03,994 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:03,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-08-06 14:05:03,994 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:03,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash 23079277, now seen corresponding path program 68 times [2021-08-06 14:05:03,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:03,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175055646] [2021-08-06 14:05:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:03,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:05,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:05,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175055646] [2021-08-06 14:05:05,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175055646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:05,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:05,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:05:05,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77459649] [2021-08-06 14:05:05,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:05:05,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:05,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:05:05,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:05:05,041 INFO L87 Difference]: Start difference. First operand 3977 states and 8162 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:10,752 INFO L93 Difference]: Finished difference Result 5903 states and 12150 transitions. [2021-08-06 14:05:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:05:10,752 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:10,759 INFO L225 Difference]: With dead ends: 5903 [2021-08-06 14:05:10,759 INFO L226 Difference]: Without dead ends: 5903 [2021-08-06 14:05:10,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 4478.4ms TimeCoverageRelationStatistics Valid=1050, Invalid=4956, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:05:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2021-08-06 14:05:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 3975. [2021-08-06 14:05:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3972 states have (on average 2.053877139979859) internal successors, (8158), 3974 states have internal predecessors, (8158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 8158 transitions. [2021-08-06 14:05:10,803 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 8158 transitions. Word has length 88 [2021-08-06 14:05:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:10,803 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 8158 transitions. [2021-08-06 14:05:10,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 8158 transitions. [2021-08-06 14:05:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:10,805 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:10,806 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:10,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-08-06 14:05:10,806 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash -615123011, now seen corresponding path program 69 times [2021-08-06 14:05:10,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:10,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992970226] [2021-08-06 14:05:10,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:10,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:11,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:11,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992970226] [2021-08-06 14:05:11,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992970226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:11,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:11,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:05:11,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487156144] [2021-08-06 14:05:11,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:05:11,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:11,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:05:11,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:05:11,823 INFO L87 Difference]: Start difference. First operand 3975 states and 8158 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:17,842 INFO L93 Difference]: Finished difference Result 5942 states and 12243 transitions. [2021-08-06 14:05:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:05:17,843 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:17,849 INFO L225 Difference]: With dead ends: 5942 [2021-08-06 14:05:17,849 INFO L226 Difference]: Without dead ends: 5942 [2021-08-06 14:05:17,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 4644.7ms TimeCoverageRelationStatistics Valid=1093, Invalid=5069, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:05:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2021-08-06 14:05:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3959. [2021-08-06 14:05:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3956 states have (on average 2.0535894843276035) internal successors, (8124), 3958 states have internal predecessors, (8124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 8124 transitions. [2021-08-06 14:05:17,894 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 8124 transitions. Word has length 88 [2021-08-06 14:05:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:17,894 INFO L470 AbstractCegarLoop]: Abstraction has 3959 states and 8124 transitions. [2021-08-06 14:05:17,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 8124 transitions. [2021-08-06 14:05:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:17,896 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:17,897 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:17,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-08-06 14:05:17,897 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1171992293, now seen corresponding path program 70 times [2021-08-06 14:05:17,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:17,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918327034] [2021-08-06 14:05:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:17,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:19,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:19,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918327034] [2021-08-06 14:05:19,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918327034] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:19,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:19,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:05:19,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082348744] [2021-08-06 14:05:19,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:05:19,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:19,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:05:19,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:05:19,093 INFO L87 Difference]: Start difference. First operand 3959 states and 8124 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:24,813 INFO L93 Difference]: Finished difference Result 5774 states and 11890 transitions. [2021-08-06 14:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:05:24,814 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:24,820 INFO L225 Difference]: With dead ends: 5774 [2021-08-06 14:05:24,820 INFO L226 Difference]: Without dead ends: 5774 [2021-08-06 14:05:24,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 4475.1ms TimeCoverageRelationStatistics Valid=1069, Invalid=5093, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:05:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2021-08-06 14:05:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 3954. [2021-08-06 14:05:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 14:05:24,877 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 14:05:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:24,877 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 14:05:24,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 14:05:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:24,880 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:24,880 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:24,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-08-06 14:05:24,880 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 738930753, now seen corresponding path program 71 times [2021-08-06 14:05:24,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:24,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432928731] [2021-08-06 14:05:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:24,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:26,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:26,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432928731] [2021-08-06 14:05:26,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432928731] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:26,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:26,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:05:26,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937651198] [2021-08-06 14:05:26,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:05:26,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:05:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:05:26,010 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:32,544 INFO L93 Difference]: Finished difference Result 6085 states and 12519 transitions. [2021-08-06 14:05:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-08-06 14:05:32,544 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:32,551 INFO L225 Difference]: With dead ends: 6085 [2021-08-06 14:05:32,551 INFO L226 Difference]: Without dead ends: 6085 [2021-08-06 14:05:32,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 5198.7ms TimeCoverageRelationStatistics Valid=1256, Invalid=5716, Unknown=0, NotChecked=0, Total=6972 [2021-08-06 14:05:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2021-08-06 14:05:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 3980. [2021-08-06 14:05:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3977 states have (on average 2.0540608498868496) internal successors, (8169), 3979 states have internal predecessors, (8169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 8169 transitions. [2021-08-06 14:05:32,598 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 8169 transitions. Word has length 88 [2021-08-06 14:05:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:32,598 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 8169 transitions. [2021-08-06 14:05:32,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 8169 transitions. [2021-08-06 14:05:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:32,601 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:32,601 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:32,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-08-06 14:05:32,601 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:32,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash 225417335, now seen corresponding path program 72 times [2021-08-06 14:05:32,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:32,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822983879] [2021-08-06 14:05:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:32,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:33,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:33,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822983879] [2021-08-06 14:05:33,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822983879] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:33,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:33,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:05:33,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720423645] [2021-08-06 14:05:33,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:05:33,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:33,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:05:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:05:33,652 INFO L87 Difference]: Start difference. First operand 3980 states and 8169 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:39,931 INFO L93 Difference]: Finished difference Result 5363 states and 11018 transitions. [2021-08-06 14:05:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:05:39,932 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:39,937 INFO L225 Difference]: With dead ends: 5363 [2021-08-06 14:05:39,937 INFO L226 Difference]: Without dead ends: 5363 [2021-08-06 14:05:39,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4731.4ms TimeCoverageRelationStatistics Valid=1123, Invalid=5197, Unknown=0, NotChecked=0, Total=6320 [2021-08-06 14:05:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2021-08-06 14:05:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 3978. [2021-08-06 14:05:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3975 states have (on average 2.0540880503144656) internal successors, (8165), 3977 states have internal predecessors, (8165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 8165 transitions. [2021-08-06 14:05:39,983 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 8165 transitions. Word has length 88 [2021-08-06 14:05:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:39,983 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 8165 transitions. [2021-08-06 14:05:39,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 8165 transitions. [2021-08-06 14:05:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:39,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:39,986 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:39,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-08-06 14:05:39,986 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:39,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:39,987 INFO L82 PathProgramCache]: Analyzing trace with hash -412784953, now seen corresponding path program 73 times [2021-08-06 14:05:39,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:39,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744843072] [2021-08-06 14:05:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:39,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:41,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:41,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744843072] [2021-08-06 14:05:41,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744843072] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:41,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:41,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:05:41,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518619917] [2021-08-06 14:05:41,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:05:41,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:05:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:05:41,031 INFO L87 Difference]: Start difference. First operand 3978 states and 8165 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:47,346 INFO L93 Difference]: Finished difference Result 5267 states and 10826 transitions. [2021-08-06 14:05:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:05:47,346 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:47,352 INFO L225 Difference]: With dead ends: 5267 [2021-08-06 14:05:47,352 INFO L226 Difference]: Without dead ends: 5267 [2021-08-06 14:05:47,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 4949.4ms TimeCoverageRelationStatistics Valid=1168, Invalid=5312, Unknown=0, NotChecked=0, Total=6480 [2021-08-06 14:05:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2021-08-06 14:05:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 3962. [2021-08-06 14:05:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3959 states have (on average 2.0538014650164182) internal successors, (8131), 3961 states have internal predecessors, (8131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 8131 transitions. [2021-08-06 14:05:47,395 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 8131 transitions. Word has length 88 [2021-08-06 14:05:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:47,395 INFO L470 AbstractCegarLoop]: Abstraction has 3962 states and 8131 transitions. [2021-08-06 14:05:47,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 8131 transitions. [2021-08-06 14:05:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:47,398 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:47,399 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:47,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-08-06 14:05:47,399 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash -655558625, now seen corresponding path program 74 times [2021-08-06 14:05:47,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:47,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801568829] [2021-08-06 14:05:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:47,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:48,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:48,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801568829] [2021-08-06 14:05:48,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801568829] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:48,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:48,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:05:48,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196821821] [2021-08-06 14:05:48,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:05:48,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:48,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:05:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:05:48,415 INFO L87 Difference]: Start difference. First operand 3962 states and 8131 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:55,256 INFO L93 Difference]: Finished difference Result 7014 states and 14437 transitions. [2021-08-06 14:05:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-06 14:05:55,256 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:05:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:55,264 INFO L225 Difference]: With dead ends: 7014 [2021-08-06 14:05:55,264 INFO L226 Difference]: Without dead ends: 7014 [2021-08-06 14:05:55,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 5377.9ms TimeCoverageRelationStatistics Valid=1340, Invalid=5970, Unknown=0, NotChecked=0, Total=7310 [2021-08-06 14:05:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2021-08-06 14:05:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 3963. [2021-08-06 14:05:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3960 states have (on average 2.0537878787878787) internal successors, (8133), 3962 states have internal predecessors, (8133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 8133 transitions. [2021-08-06 14:05:55,331 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 8133 transitions. Word has length 88 [2021-08-06 14:05:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:55,331 INFO L470 AbstractCegarLoop]: Abstraction has 3963 states and 8133 transitions. [2021-08-06 14:05:55,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 8133 transitions. [2021-08-06 14:05:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:05:55,334 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:55,334 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:55,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-08-06 14:05:55,334 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:05:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash 15170517, now seen corresponding path program 75 times [2021-08-06 14:05:55,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:55,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000510146] [2021-08-06 14:05:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:55,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:56,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:56,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000510146] [2021-08-06 14:05:56,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000510146] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:56,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:56,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:05:56,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460724531] [2021-08-06 14:05:56,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:05:56,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:05:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:05:56,459 INFO L87 Difference]: Start difference. First operand 3963 states and 8133 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:02,925 INFO L93 Difference]: Finished difference Result 6174 states and 12697 transitions. [2021-08-06 14:06:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-06 14:06:02,925 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:02,931 INFO L225 Difference]: With dead ends: 6174 [2021-08-06 14:06:02,931 INFO L226 Difference]: Without dead ends: 6174 [2021-08-06 14:06:02,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 5068.6ms TimeCoverageRelationStatistics Valid=1212, Invalid=5594, Unknown=0, NotChecked=0, Total=6806 [2021-08-06 14:06:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2021-08-06 14:06:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 3965. [2021-08-06 14:06:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3962 states have (on average 2.0537607269056033) internal successors, (8137), 3964 states have internal predecessors, (8137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 8137 transitions. [2021-08-06 14:06:02,982 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 8137 transitions. Word has length 88 [2021-08-06 14:06:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:02,982 INFO L470 AbstractCegarLoop]: Abstraction has 3965 states and 8137 transitions. [2021-08-06 14:06:02,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 8137 transitions. [2021-08-06 14:06:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:02,985 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:02,985 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:02,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-08-06 14:06:02,985 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1251330581, now seen corresponding path program 76 times [2021-08-06 14:06:02,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:02,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242718009] [2021-08-06 14:06:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:02,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:04,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:04,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242718009] [2021-08-06 14:06:04,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242718009] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:04,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:04,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:06:04,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901859898] [2021-08-06 14:06:04,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:06:04,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:04,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:06:04,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:06:04,041 INFO L87 Difference]: Start difference. First operand 3965 states and 8137 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:09,937 INFO L93 Difference]: Finished difference Result 5341 states and 10974 transitions. [2021-08-06 14:06:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:06:09,937 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:09,943 INFO L225 Difference]: With dead ends: 5341 [2021-08-06 14:06:09,943 INFO L226 Difference]: Without dead ends: 5341 [2021-08-06 14:06:09,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 4596.8ms TimeCoverageRelationStatistics Valid=1081, Invalid=5081, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:06:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2021-08-06 14:06:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 3954. [2021-08-06 14:06:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 2.0536573019488737) internal successors, (8114), 3953 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 8114 transitions. [2021-08-06 14:06:09,983 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 8114 transitions. Word has length 88 [2021-08-06 14:06:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:09,983 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 8114 transitions. [2021-08-06 14:06:09,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 8114 transitions. [2021-08-06 14:06:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:09,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:09,986 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:09,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-08-06 14:06:09,987 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash -911385165, now seen corresponding path program 77 times [2021-08-06 14:06:09,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:09,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596260390] [2021-08-06 14:06:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:09,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:11,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:11,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596260390] [2021-08-06 14:06:11,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596260390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:11,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:11,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:06:11,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936738589] [2021-08-06 14:06:11,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:06:11,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:11,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:06:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:06:11,015 INFO L87 Difference]: Start difference. First operand 3954 states and 8114 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:18,080 INFO L93 Difference]: Finished difference Result 5643 states and 11575 transitions. [2021-08-06 14:06:18,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-08-06 14:06:18,081 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:18,087 INFO L225 Difference]: With dead ends: 5643 [2021-08-06 14:06:18,088 INFO L226 Difference]: Without dead ends: 5643 [2021-08-06 14:06:18,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 5717.0ms TimeCoverageRelationStatistics Valid=1381, Invalid=6101, Unknown=0, NotChecked=0, Total=7482 [2021-08-06 14:06:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-08-06 14:06:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 3966. [2021-08-06 14:06:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-06 14:06:18,138 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-06 14:06:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:18,138 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-06 14:06:18,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-06 14:06:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:18,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:18,142 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:18,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-08-06 14:06:18,142 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash 86336509, now seen corresponding path program 78 times [2021-08-06 14:06:18,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:18,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159890608] [2021-08-06 14:06:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:18,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:19,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:19,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159890608] [2021-08-06 14:06:19,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159890608] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:19,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:19,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:06:19,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192553370] [2021-08-06 14:06:19,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:06:19,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:06:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:06:19,179 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:25,952 INFO L93 Difference]: Finished difference Result 6032 states and 12398 transitions. [2021-08-06 14:06:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-06 14:06:25,952 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:25,959 INFO L225 Difference]: With dead ends: 6032 [2021-08-06 14:06:25,959 INFO L226 Difference]: Without dead ends: 6032 [2021-08-06 14:06:25,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 5257.0ms TimeCoverageRelationStatistics Valid=1297, Invalid=5843, Unknown=0, NotChecked=0, Total=7140 [2021-08-06 14:06:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2021-08-06 14:06:26,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3967. [2021-08-06 14:06:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 3964 states have (on average 2.053481331987891) internal successors, (8140), 3966 states have internal predecessors, (8140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 8140 transitions. [2021-08-06 14:06:26,035 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 8140 transitions. Word has length 88 [2021-08-06 14:06:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:26,035 INFO L470 AbstractCegarLoop]: Abstraction has 3967 states and 8140 transitions. [2021-08-06 14:06:26,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 8140 transitions. [2021-08-06 14:06:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:26,037 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:26,038 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:26,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-08-06 14:06:26,038 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 757065651, now seen corresponding path program 79 times [2021-08-06 14:06:26,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:26,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916727943] [2021-08-06 14:06:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:26,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:27,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:27,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916727943] [2021-08-06 14:06:27,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916727943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:27,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:27,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:06:27,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931674473] [2021-08-06 14:06:27,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:06:27,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:27,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:06:27,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:06:27,189 INFO L87 Difference]: Start difference. First operand 3967 states and 8140 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:33,263 INFO L93 Difference]: Finished difference Result 5954 states and 12239 transitions. [2021-08-06 14:06:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:06:33,263 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:33,269 INFO L225 Difference]: With dead ends: 5954 [2021-08-06 14:06:33,269 INFO L226 Difference]: Without dead ends: 5954 [2021-08-06 14:06:33,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 4698.2ms TimeCoverageRelationStatistics Valid=1171, Invalid=5471, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:06:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2021-08-06 14:06:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3969. [2021-08-06 14:06:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3966 states have (on average 2.05345436207766) internal successors, (8144), 3968 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 8144 transitions. [2021-08-06 14:06:33,312 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 8144 transitions. Word has length 88 [2021-08-06 14:06:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:33,313 INFO L470 AbstractCegarLoop]: Abstraction has 3969 states and 8144 transitions. [2021-08-06 14:06:33,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 8144 transitions. [2021-08-06 14:06:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:33,315 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:33,315 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:33,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-08-06 14:06:33,316 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1993225715, now seen corresponding path program 80 times [2021-08-06 14:06:33,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:33,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284989621] [2021-08-06 14:06:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:33,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:34,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:34,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284989621] [2021-08-06 14:06:34,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284989621] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:34,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:34,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:06:34,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038951378] [2021-08-06 14:06:34,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:06:34,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:34,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:06:34,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:06:34,373 INFO L87 Difference]: Start difference. First operand 3969 states and 8144 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:40,171 INFO L93 Difference]: Finished difference Result 5121 states and 10516 transitions. [2021-08-06 14:06:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-06 14:06:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:40,177 INFO L225 Difference]: With dead ends: 5121 [2021-08-06 14:06:40,177 INFO L226 Difference]: Without dead ends: 5121 [2021-08-06 14:06:40,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 4370.6ms TimeCoverageRelationStatistics Valid=1042, Invalid=4964, Unknown=0, NotChecked=0, Total=6006 [2021-08-06 14:06:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2021-08-06 14:06:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 3966. [2021-08-06 14:06:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 2.053494827151148) internal successors, (8138), 3965 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 8138 transitions. [2021-08-06 14:06:40,231 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 8138 transitions. Word has length 88 [2021-08-06 14:06:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:40,231 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 8138 transitions. [2021-08-06 14:06:40,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 8138 transitions. [2021-08-06 14:06:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:40,234 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:40,234 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:40,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-08-06 14:06:40,234 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:40,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash 65500127, now seen corresponding path program 81 times [2021-08-06 14:06:40,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:40,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936494776] [2021-08-06 14:06:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:40,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:41,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:41,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936494776] [2021-08-06 14:06:41,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936494776] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:41,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:41,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:06:41,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895230263] [2021-08-06 14:06:41,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:06:41,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:41,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:06:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:06:41,230 INFO L87 Difference]: Start difference. First operand 3966 states and 8138 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:47,654 INFO L93 Difference]: Finished difference Result 6430 states and 13244 transitions. [2021-08-06 14:06:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-06 14:06:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:47,661 INFO L225 Difference]: With dead ends: 6430 [2021-08-06 14:06:47,662 INFO L226 Difference]: Without dead ends: 6430 [2021-08-06 14:06:47,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 4947.0ms TimeCoverageRelationStatistics Valid=1220, Invalid=5586, Unknown=0, NotChecked=0, Total=6806 [2021-08-06 14:06:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2021-08-06 14:06:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 3993. [2021-08-06 14:06:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3990 states have (on average 2.0538847117794488) internal successors, (8195), 3992 states have internal predecessors, (8195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 8195 transitions. [2021-08-06 14:06:47,706 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 8195 transitions. Word has length 88 [2021-08-06 14:06:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:47,706 INFO L470 AbstractCegarLoop]: Abstraction has 3993 states and 8195 transitions. [2021-08-06 14:06:47,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 8195 transitions. [2021-08-06 14:06:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:47,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:47,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:47,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-08-06 14:06:47,709 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:47,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash -448013291, now seen corresponding path program 82 times [2021-08-06 14:06:47,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:47,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627240006] [2021-08-06 14:06:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:47,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:48,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:48,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627240006] [2021-08-06 14:06:48,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627240006] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:48,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:48,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:06:48,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576242026] [2021-08-06 14:06:48,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:06:48,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:06:48,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:06:48,746 INFO L87 Difference]: Start difference. First operand 3993 states and 8195 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:06:54,699 INFO L93 Difference]: Finished difference Result 5708 states and 11743 transitions. [2021-08-06 14:06:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-06 14:06:54,699 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:06:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:06:54,705 INFO L225 Difference]: With dead ends: 5708 [2021-08-06 14:06:54,706 INFO L226 Difference]: Without dead ends: 5708 [2021-08-06 14:06:54,706 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4530.5ms TimeCoverageRelationStatistics Valid=1087, Invalid=5075, Unknown=0, NotChecked=0, Total=6162 [2021-08-06 14:06:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2021-08-06 14:06:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 3991. [2021-08-06 14:06:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3988 states have (on average 2.0539117352056167) internal successors, (8191), 3990 states have internal predecessors, (8191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 8191 transitions. [2021-08-06 14:06:54,753 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 8191 transitions. Word has length 88 [2021-08-06 14:06:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:06:54,753 INFO L470 AbstractCegarLoop]: Abstraction has 3991 states and 8191 transitions. [2021-08-06 14:06:54,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:06:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 8191 transitions. [2021-08-06 14:06:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:06:54,756 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:06:54,756 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:06:54,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-08-06 14:06:54,757 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:06:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:06:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1086215579, now seen corresponding path program 83 times [2021-08-06 14:06:54,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:06:54,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354610610] [2021-08-06 14:06:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:06:54,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:06:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:06:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:06:55,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:06:55,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354610610] [2021-08-06 14:06:55,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354610610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:06:55,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:06:55,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-06 14:06:55,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894392951] [2021-08-06 14:06:55,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-06 14:06:55,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:06:55,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-06 14:06:55,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2021-08-06 14:06:55,795 INFO L87 Difference]: Start difference. First operand 3991 states and 8191 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:07:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:07:01,861 INFO L93 Difference]: Finished difference Result 5612 states and 11551 transitions. [2021-08-06 14:07:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:07:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-06 14:07:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:07:01,868 INFO L225 Difference]: With dead ends: 5612 [2021-08-06 14:07:01,868 INFO L226 Difference]: Without dead ends: 5612 [2021-08-06 14:07:01,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 4747.9ms TimeCoverageRelationStatistics Valid=1131, Invalid=5189, Unknown=0, NotChecked=0, Total=6320 [2021-08-06 14:07:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2021-08-06 14:07:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 3975. [2021-08-06 14:07:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3972 states have (on average 2.0536253776435047) internal successors, (8157), 3974 states have internal predecessors, (8157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:07:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 8157 transitions. [2021-08-06 14:07:01,913 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 8157 transitions. Word has length 88 [2021-08-06 14:07:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:07:01,913 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 8157 transitions. [2021-08-06 14:07:01,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:07:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 8157 transitions. [2021-08-06 14:07:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-06 14:07:01,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:07:01,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:07:01,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-08-06 14:07:01,916 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 14:07:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:07:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1328989251, now seen corresponding path program 84 times [2021-08-06 14:07:01,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:07:01,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015892084] [2021-08-06 14:07:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:07:01,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:07:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:07:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:07:03,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:07:03,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015892084] [2021-08-06 14:07:03,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015892084] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:07:03,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:07:03,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-06 14:07:03,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128869589] [2021-08-06 14:07:03,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-06 14:07:03,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:07:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-06 14:07:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2021-08-06 14:07:03,035 INFO L87 Difference]: Start difference. First operand 3975 states and 8157 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2021-08-06 14:07:05,456 WARN L223 SmtUtils]: Removed 14 from assertion stack [2021-08-06 14:07:05,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-06 14:07:05,457 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 14:07:05,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-08-06 14:07:05,457 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (3975states) and FLOYD_HOARE automaton (currently 21 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 107 for 119ms.. [2021-08-06 14:07:05,458 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 14:07:05,459 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 14:07:05,461 INFO L308 ceAbstractionStarter]: Result for error location reader_fnThread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2021-08-06 14:07:05,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 14:07:05,463 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 14:07:05,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-06 14:07:05,463 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing initial abstraction,while executing BasicCegarLoop. [2021-08-06 14:07:05,463 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 14:07:05,463 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/2) [2021-08-06 14:07:05,464 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 14:07:05,464 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 14:07:05,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 02:07:05 BasicIcfg [2021-08-06 14:07:05,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 14:07:05,466 INFO L168 Benchmark]: Toolchain (without parser) took 731047.47 ms. Allocated memory was 212.9 MB in the beginning and 740.3 MB in the end (delta: 527.4 MB). Free memory was 175.2 MB in the beginning and 486.1 MB in the end (delta: -310.9 MB). Peak memory consumption was 218.0 MB. Max. memory is 8.0 GB. [2021-08-06 14:07:05,466 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 212.9 MB. Free memory is still 193.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 14:07:05,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.02 ms. Allocated memory is still 212.9 MB. Free memory was 174.9 MB in the beginning and 184.0 MB in the end (delta: -9.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. [2021-08-06 14:07:05,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.51 ms. Allocated memory is still 212.9 MB. Free memory was 184.0 MB in the beginning and 181.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 14:07:05,466 INFO L168 Benchmark]: Boogie Preprocessor took 29.51 ms. Allocated memory is still 212.9 MB. Free memory was 181.4 MB in the beginning and 179.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-06 14:07:05,466 INFO L168 Benchmark]: RCFGBuilder took 522.21 ms. Allocated memory is still 212.9 MB. Free memory was 179.3 MB in the beginning and 147.3 MB in the end (delta: 32.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. [2021-08-06 14:07:05,466 INFO L168 Benchmark]: TraceAbstraction took 729985.59 ms. Allocated memory was 212.9 MB in the beginning and 740.3 MB in the end (delta: 527.4 MB). Free memory was 146.8 MB in the beginning and 486.1 MB in the end (delta: -339.3 MB). Peak memory consumption was 189.2 MB. Max. memory is 8.0 GB. [2021-08-06 14:07:05,466 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.12 ms. Allocated memory is still 212.9 MB. Free memory is still 193.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 444.02 ms. Allocated memory is still 212.9 MB. Free memory was 174.9 MB in the beginning and 184.0 MB in the end (delta: -9.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 59.51 ms. Allocated memory is still 212.9 MB. Free memory was 184.0 MB in the beginning and 181.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.51 ms. Allocated memory is still 212.9 MB. Free memory was 181.4 MB in the beginning and 179.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 522.21 ms. Allocated memory is still 212.9 MB. Free memory was 179.3 MB in the beginning and 147.3 MB in the end (delta: 32.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 729985.59 ms. Allocated memory was 212.9 MB in the beginning and 740.3 MB in the end (delta: 527.4 MB). Free memory was 146.8 MB in the beginning and 486.1 MB in the end (delta: -339.3 MB). Peak memory consumption was 189.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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 (3975states) and FLOYD_HOARE automaton (currently 21 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 107 for 119ms.. - TimeoutResultAtElement [Line: 836]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (3975states) and FLOYD_HOARE automaton (currently 21 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 107 for 119ms.. - TimeoutResultAtElement [Line: 837]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (3975states) and FLOYD_HOARE automaton (currently 21 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 107 for 119ms.. - 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 initial abstraction,while executing BasicCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: reader_fnThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 198 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 729831.2ms, OverallIterations: 97, TraceHistogramMax: 1, EmptinessCheckTime: 284.1ms, AutomataDifference: 625790.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 80.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45507 SDtfs, 154136 SDslu, 761951 SDs, 0 SdLazy, 349305 SolverSat, 4140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 135406.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8150 GetRequests, 389 SyntacticMatches, 165 SemanticMatches, 7595 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108484 ImplicationChecksByTransitivity, 500057.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3993occurred in iteration=94, InterpolantAutomatonStates: 4857, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4513.3ms AutomataMinimizationTime, 96 MinimizatonAttempts, 177525 StatesRemovedByMinimization, 95 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 131.6ms SsaConstructionTime, 911.4ms SatisfiabilityAnalysisTime, 97365.0ms InterpolantComputationTime, 8378 NumberOfCodeBlocks, 8378 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 8281 ConstructedInterpolants, 0 QuantifiedInterpolants, 148346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 97 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 198 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown