/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_o20.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.0-7d8eed3
[2020-11-07 00:42:40,648 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-11-07 00:42:40,652 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-11-07 00:42:40,710 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-11-07 00:42:40,711 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-11-07 00:42:40,715 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-11-07 00:42:40,719 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-11-07 00:42:40,729 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-11-07 00:42:40,733 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-11-07 00:42:40,739 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-11-07 00:42:40,741 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-11-07 00:42:40,743 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-11-07 00:42:40,743 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-11-07 00:42:40,747 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-11-07 00:42:40,749 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-11-07 00:42:40,752 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-11-07 00:42:40,753 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-11-07 00:42:40,757 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-11-07 00:42:40,766 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-11-07 00:42:40,775 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-11-07 00:42:40,778 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-11-07 00:42:40,779 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-11-07 00:42:40,781 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-11-07 00:42:40,784 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-11-07 00:42:40,814 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-11-07 00:42:40,815 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-11-07 00:42:40,815 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-11-07 00:42:40,818 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-11-07 00:42:40,818 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-11-07 00:42:40,820 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-11-07 00:42:40,820 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-11-07 00:42:40,821 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-11-07 00:42:40,823 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-11-07 00:42:40,824 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-11-07 00:42:40,826 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-11-07 00:42:40,826 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-11-07 00:42:40,827 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-11-07 00:42:40,827 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-11-07 00:42:40,828 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-11-07 00:42:40,829 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-11-07 00:42:40,830 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-11-07 00:42:40,831 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-11-07 00:42:40,856 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-11-07 00:42:40,857 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-11-07 00:42:40,861 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-11-07 00:42:40,862 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-11-07 00:42:40,862 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-11-07 00:42:40,862 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-11-07 00:42:40,862 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-11-07 00:42:40,863 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-11-07 00:42:40,863 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-11-07 00:42:40,863 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-11-07 00:42:40,865 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-11-07 00:42:40,865 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-11-07 00:42:40,865 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-11-07 00:42:40,866 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-11-07 00:42:40,866 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-11-07 00:42:40,866 INFO  L138        SettingsManager]:  * Size of a code block=SingleStatement
[2020-11-07 00:42:40,867 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-11-07 00:42:40,867 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-11-07 00:42:40,867 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-07 00:42:40,868 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-11-07 00:42:40,868 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-11-07 00:42:40,868 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-11-07 00:42:40,868 INFO  L138        SettingsManager]:  * Use separate solver for trace checks=false
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
[2020-11-07 00:42:41,295 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-11-07 00:42:41,334 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-11-07 00:42:41,338 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-11-07 00:42:41,339 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-11-07 00:42:41,340 INFO  L275        PluginConnector]: CDTParser initialized
[2020-11-07 00:42:41,341 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c
[2020-11-07 00:42:41,432 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fdaaaea/4896c929a6364237856591338c879fd9/FLAGb6aef120a
[2020-11-07 00:42:42,144 INFO  L306              CDTParser]: Found 1 translation units.
[2020-11-07 00:42:42,145 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o20.c
[2020-11-07 00:42:42,152 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fdaaaea/4896c929a6364237856591338c879fd9/FLAGb6aef120a
[2020-11-07 00:42:42,533 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fdaaaea/4896c929a6364237856591338c879fd9
[2020-11-07 00:42:42,536 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-11-07 00:42:42,543 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-11-07 00:42:42,545 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-11-07 00:42:42,545 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-11-07 00:42:42,549 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-11-07 00:42:42,550 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,554 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2b09ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42, skipping insertion in model container
[2020-11-07 00:42:42,554 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,563 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-11-07 00:42:42,578 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-11-07 00:42:42,728 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-11-07 00:42:42,739 INFO  L203         MainTranslator]: Completed pre-run
[2020-11-07 00:42:42,757 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-11-07 00:42:42,775 INFO  L208         MainTranslator]: Completed translation
[2020-11-07 00:42:42,775 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42 WrapperNode
[2020-11-07 00:42:42,776 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-11-07 00:42:42,777 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-11-07 00:42:42,778 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-11-07 00:42:42,778 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-11-07 00:42:42,793 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,794 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,802 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,803 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,809 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,811 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,813 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
[2020-11-07 00:42:42,815 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-11-07 00:42:42,816 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-11-07 00:42:42,817 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-11-07 00:42:42,817 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-11-07 00:42:42,818 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-07 00:42:42,911 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-11-07 00:42:42,912 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-11-07 00:42:42,913 INFO  L138     BoogieDeclarations]: Found implementation of procedure reach_error
[2020-11-07 00:42:42,913 INFO  L138     BoogieDeclarations]: Found implementation of procedure id
[2020-11-07 00:42:42,913 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-11-07 00:42:42,913 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2020-11-07 00:42:42,914 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2020-11-07 00:42:42,914 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert_fail
[2020-11-07 00:42:42,914 INFO  L130     BoogieDeclarations]: Found specification of procedure reach_error
[2020-11-07 00:42:42,914 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-11-07 00:42:42,915 INFO  L130     BoogieDeclarations]: Found specification of procedure id
[2020-11-07 00:42:42,915 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-11-07 00:42:42,916 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-11-07 00:42:42,916 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-11-07 00:42:42,916 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-11-07 00:42:42,917 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-11-07 00:42:42,917 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-11-07 00:42:42,917 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-11-07 00:42:43,282 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-11-07 00:42:43,283 INFO  L298             CfgBuilder]: Removed 0 assume(true) statements.
[2020-11-07 00:42:43,285 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:43 BoogieIcfgContainer
[2020-11-07 00:42:43,285 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-11-07 00:42:43,287 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-11-07 00:42:43,288 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-11-07 00:42:43,292 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-11-07 00:42:43,292 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:42" (1/3) ...
[2020-11-07 00:42:43,293 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25892ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:43, skipping insertion in model container
[2020-11-07 00:42:43,294 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:42" (2/3) ...
[2020-11-07 00:42:43,294 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25892ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:43, skipping insertion in model container
[2020-11-07 00:42:43,294 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:43" (3/3) ...
[2020-11-07 00:42:43,296 INFO  L111   eAbstractionObserver]: Analyzing ICFG id_o20.c
[2020-11-07 00:42:43,342 INFO  L179   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-11-07 00:42:43,346 INFO  L191   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-11-07 00:42:43,361 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-11-07 00:42:43,389 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-11-07 00:42:43,390 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-11-07 00:42:43,390 INFO  L379      AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation
[2020-11-07 00:42:43,390 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-11-07 00:42:43,390 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-11-07 00:42:43,391 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-11-07 00:42:43,391 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-11-07 00:42:43,391 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-11-07 00:42:43,426 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states.
[2020-11-07 00:42:43,442 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2020-11-07 00:42:43,442 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:43,443 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:43,444 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:43,458 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:43,459 INFO  L82        PathProgramCache]: Analyzing trace with hash -2039876327, now seen corresponding path program 1 times
[2020-11-07 00:42:43,469 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:43,470 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130665822]
[2020-11-07 00:42:43,471 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:43,568 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:43,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:43,953 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:43,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:43,976 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:43,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:44,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-07 00:42:44,031 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130665822]
[2020-11-07 00:42:44,034 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:44,034 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-07 00:42:44,035 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246772068]
[2020-11-07 00:42:44,040 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-07 00:42:44,040 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:44,055 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-07 00:42:44,056 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-11-07 00:42:44,058 INFO  L87              Difference]: Start difference. First operand 36 states. Second operand 6 states.
[2020-11-07 00:42:44,591 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:44,591 INFO  L93              Difference]: Finished difference Result 50 states and 54 transitions.
[2020-11-07 00:42:44,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-11-07 00:42:44,594 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2020-11-07 00:42:44,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:44,605 INFO  L225             Difference]: With dead ends: 50
[2020-11-07 00:42:44,605 INFO  L226             Difference]: Without dead ends: 31
[2020-11-07 00:42:44,610 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2020-11-07 00:42:44,635 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2020-11-07 00:42:44,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2020-11-07 00:42:44,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2020-11-07 00:42:44,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions.
[2020-11-07 00:42:44,715 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25
[2020-11-07 00:42:44,717 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:44,717 INFO  L481      AbstractCegarLoop]: Abstraction has 31 states and 32 transitions.
[2020-11-07 00:42:44,717 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-11-07 00:42:44,719 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions.
[2020-11-07 00:42:44,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2020-11-07 00:42:44,724 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:44,724 INFO  L422         BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:44,725 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-11-07 00:42:44,725 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:44,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:44,736 INFO  L82        PathProgramCache]: Analyzing trace with hash -1789799325, now seen corresponding path program 1 times
[2020-11-07 00:42:44,737 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:44,737 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076883802]
[2020-11-07 00:42:44,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:44,744 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:44,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:44,918 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:44,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:44,931 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:44,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:44,987 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:44,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:45,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-11-07 00:42:45,022 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076883802]
[2020-11-07 00:42:45,022 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:45,023 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-11-07 00:42:45,023 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535156568]
[2020-11-07 00:42:45,024 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-11-07 00:42:45,024 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:45,025 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-11-07 00:42:45,025 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2020-11-07 00:42:45,026 INFO  L87              Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states.
[2020-11-07 00:42:45,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:45,486 INFO  L93              Difference]: Finished difference Result 41 states and 42 transitions.
[2020-11-07 00:42:45,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-11-07 00:42:45,487 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 32
[2020-11-07 00:42:45,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:45,489 INFO  L225             Difference]: With dead ends: 41
[2020-11-07 00:42:45,490 INFO  L226             Difference]: Without dead ends: 35
[2020-11-07 00:42:45,492 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210
[2020-11-07 00:42:45,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2020-11-07 00:42:45,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2020-11-07 00:42:45,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2020-11-07 00:42:45,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions.
[2020-11-07 00:42:45,506 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32
[2020-11-07 00:42:45,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:45,507 INFO  L481      AbstractCegarLoop]: Abstraction has 35 states and 36 transitions.
[2020-11-07 00:42:45,507 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-11-07 00:42:45,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions.
[2020-11-07 00:42:45,521 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2020-11-07 00:42:45,522 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:45,522 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:45,522 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-11-07 00:42:45,522 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:45,523 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:45,523 INFO  L82        PathProgramCache]: Analyzing trace with hash 819538851, now seen corresponding path program 2 times
[2020-11-07 00:42:45,523 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:45,524 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702783196]
[2020-11-07 00:42:45,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:45,527 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:45,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:45,643 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:45,647 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:45,655 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:45,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:45,701 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:45,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:45,748 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:45,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:45,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2020-11-07 00:42:45,786 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [702783196]
[2020-11-07 00:42:45,786 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:45,786 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-11-07 00:42:45,787 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271783471]
[2020-11-07 00:42:45,787 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-11-07 00:42:45,788 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:45,788 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-11-07 00:42:45,789 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2020-11-07 00:42:45,789 INFO  L87              Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states.
[2020-11-07 00:42:46,412 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:46,412 INFO  L93              Difference]: Finished difference Result 45 states and 46 transitions.
[2020-11-07 00:42:46,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-11-07 00:42:46,413 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 39
[2020-11-07 00:42:46,414 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:46,415 INFO  L225             Difference]: With dead ends: 45
[2020-11-07 00:42:46,415 INFO  L226             Difference]: Without dead ends: 39
[2020-11-07 00:42:46,416 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380
[2020-11-07 00:42:46,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2020-11-07 00:42:46,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2020-11-07 00:42:46,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2020-11-07 00:42:46,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions.
[2020-11-07 00:42:46,429 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 39
[2020-11-07 00:42:46,430 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:46,430 INFO  L481      AbstractCegarLoop]: Abstraction has 39 states and 40 transitions.
[2020-11-07 00:42:46,430 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-11-07 00:42:46,430 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions.
[2020-11-07 00:42:46,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2020-11-07 00:42:46,432 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:46,432 INFO  L422         BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:46,433 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-11-07 00:42:46,433 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:46,433 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:46,434 INFO  L82        PathProgramCache]: Analyzing trace with hash 1214666029, now seen corresponding path program 3 times
[2020-11-07 00:42:46,434 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:46,434 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [759427721]
[2020-11-07 00:42:46,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:46,437 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:46,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:46,536 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:46,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:46,544 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:46,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:46,607 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:46,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:46,671 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:46,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:46,742 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:46,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:46,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2020-11-07 00:42:46,778 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [759427721]
[2020-11-07 00:42:46,779 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:46,779 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-11-07 00:42:46,779 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595415080]
[2020-11-07 00:42:46,780 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-11-07 00:42:46,780 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:46,781 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-11-07 00:42:46,782 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2020-11-07 00:42:46,782 INFO  L87              Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 12 states.
[2020-11-07 00:42:47,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:47,625 INFO  L93              Difference]: Finished difference Result 49 states and 50 transitions.
[2020-11-07 00:42:47,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2020-11-07 00:42:47,627 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 46
[2020-11-07 00:42:47,627 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:47,629 INFO  L225             Difference]: With dead ends: 49
[2020-11-07 00:42:47,629 INFO  L226             Difference]: Without dead ends: 43
[2020-11-07 00:42:47,630 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600
[2020-11-07 00:42:47,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2020-11-07 00:42:47,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2020-11-07 00:42:47,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2020-11-07 00:42:47,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions.
[2020-11-07 00:42:47,642 INFO  L78                 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 46
[2020-11-07 00:42:47,643 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:47,643 INFO  L481      AbstractCegarLoop]: Abstraction has 43 states and 44 transitions.
[2020-11-07 00:42:47,643 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-11-07 00:42:47,643 INFO  L276                IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions.
[2020-11-07 00:42:47,645 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2020-11-07 00:42:47,645 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:47,645 INFO  L422         BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:47,646 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-11-07 00:42:47,646 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:47,646 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:47,646 INFO  L82        PathProgramCache]: Analyzing trace with hash -461443027, now seen corresponding path program 4 times
[2020-11-07 00:42:47,647 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:47,647 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408169732]
[2020-11-07 00:42:47,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:47,649 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:47,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:47,782 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:47,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:47,791 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:47,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:47,856 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:47,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:47,902 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:47,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:47,947 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:47,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:47,992 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:47,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:48,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2020-11-07 00:42:48,030 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408169732]
[2020-11-07 00:42:48,031 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:48,031 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2020-11-07 00:42:48,031 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175927966]
[2020-11-07 00:42:48,032 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 14 states
[2020-11-07 00:42:48,032 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:48,032 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2020-11-07 00:42:48,033 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2020-11-07 00:42:48,033 INFO  L87              Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 14 states.
[2020-11-07 00:42:49,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:49,156 INFO  L93              Difference]: Finished difference Result 53 states and 54 transitions.
[2020-11-07 00:42:49,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2020-11-07 00:42:49,157 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 53
[2020-11-07 00:42:49,157 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:49,159 INFO  L225             Difference]: With dead ends: 53
[2020-11-07 00:42:49,159 INFO  L226             Difference]: Without dead ends: 47
[2020-11-07 00:42:49,160 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870
[2020-11-07 00:42:49,161 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2020-11-07 00:42:49,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2020-11-07 00:42:49,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2020-11-07 00:42:49,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions.
[2020-11-07 00:42:49,176 INFO  L78                 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 53
[2020-11-07 00:42:49,176 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:49,176 INFO  L481      AbstractCegarLoop]: Abstraction has 47 states and 48 transitions.
[2020-11-07 00:42:49,176 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 14 states.
[2020-11-07 00:42:49,177 INFO  L276                IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions.
[2020-11-07 00:42:49,178 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2020-11-07 00:42:49,178 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:49,178 INFO  L422         BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:49,179 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-11-07 00:42:49,179 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:49,179 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:49,180 INFO  L82        PathProgramCache]: Analyzing trace with hash 1951577079, now seen corresponding path program 5 times
[2020-11-07 00:42:49,180 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:49,180 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92229380]
[2020-11-07 00:42:49,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:49,183 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:49,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,281 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:49,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,288 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:49,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,338 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:49,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,382 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:49,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,428 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:49,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,476 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:49,479 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,528 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:49,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:49,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2020-11-07 00:42:49,570 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92229380]
[2020-11-07 00:42:49,570 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:49,570 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2020-11-07 00:42:49,570 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049971768]
[2020-11-07 00:42:49,571 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 16 states
[2020-11-07 00:42:49,571 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:49,571 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2020-11-07 00:42:49,572 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240
[2020-11-07 00:42:49,572 INFO  L87              Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 16 states.
[2020-11-07 00:42:50,833 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:50,834 INFO  L93              Difference]: Finished difference Result 57 states and 58 transitions.
[2020-11-07 00:42:50,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2020-11-07 00:42:50,834 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states. Word has length 60
[2020-11-07 00:42:50,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:50,837 INFO  L225             Difference]: With dead ends: 57
[2020-11-07 00:42:50,837 INFO  L226             Difference]: Without dead ends: 51
[2020-11-07 00:42:50,839 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190
[2020-11-07 00:42:50,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2020-11-07 00:42:50,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2020-11-07 00:42:50,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2020-11-07 00:42:50,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions.
[2020-11-07 00:42:50,852 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 60
[2020-11-07 00:42:50,852 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:50,852 INFO  L481      AbstractCegarLoop]: Abstraction has 51 states and 52 transitions.
[2020-11-07 00:42:50,852 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 16 states.
[2020-11-07 00:42:50,853 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions.
[2020-11-07 00:42:50,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2020-11-07 00:42:50,854 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:50,854 INFO  L422         BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:50,854 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-11-07 00:42:50,855 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:50,855 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:50,855 INFO  L82        PathProgramCache]: Analyzing trace with hash -1085586761, now seen corresponding path program 6 times
[2020-11-07 00:42:50,855 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:50,856 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [513206445]
[2020-11-07 00:42:50,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:50,858 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:50,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:50,969 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:50,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:50,975 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:50,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:51,021 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:51,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:51,069 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:51,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:51,119 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:51,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:51,170 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:51,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:51,222 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:51,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:51,279 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:51,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:51,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2020-11-07 00:42:51,331 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [513206445]
[2020-11-07 00:42:51,331 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:51,331 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2020-11-07 00:42:51,331 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911362149]
[2020-11-07 00:42:51,332 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 18 states
[2020-11-07 00:42:51,332 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:51,333 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2020-11-07 00:42:51,333 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306
[2020-11-07 00:42:51,333 INFO  L87              Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 18 states.
[2020-11-07 00:42:52,975 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:52,975 INFO  L93              Difference]: Finished difference Result 61 states and 62 transitions.
[2020-11-07 00:42:52,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2020-11-07 00:42:52,976 INFO  L78                 Accepts]: Start accepts. Automaton has 18 states. Word has length 67
[2020-11-07 00:42:52,977 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:52,978 INFO  L225             Difference]: With dead ends: 61
[2020-11-07 00:42:52,980 INFO  L226             Difference]: Without dead ends: 55
[2020-11-07 00:42:52,982 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560
[2020-11-07 00:42:52,982 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2020-11-07 00:42:53,009 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2020-11-07 00:42:53,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2020-11-07 00:42:53,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions.
[2020-11-07 00:42:53,013 INFO  L78                 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 67
[2020-11-07 00:42:53,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:53,017 INFO  L481      AbstractCegarLoop]: Abstraction has 55 states and 56 transitions.
[2020-11-07 00:42:53,017 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 18 states.
[2020-11-07 00:42:53,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions.
[2020-11-07 00:42:53,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2020-11-07 00:42:53,022 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:53,023 INFO  L422         BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:53,023 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-11-07 00:42:53,023 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:53,024 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:53,024 INFO  L82        PathProgramCache]: Analyzing trace with hash -1506086719, now seen corresponding path program 7 times
[2020-11-07 00:42:53,024 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:53,024 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79114417]
[2020-11-07 00:42:53,025 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:53,028 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:53,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,161 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:53,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,171 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:53,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,226 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:53,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,299 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:53,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,354 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:53,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,415 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:53,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,474 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:53,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,531 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:53,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,593 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:53,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:53,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2020-11-07 00:42:53,652 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [79114417]
[2020-11-07 00:42:53,653 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:53,653 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2020-11-07 00:42:53,653 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882698600]
[2020-11-07 00:42:53,653 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 20 states
[2020-11-07 00:42:53,653 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:53,654 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2020-11-07 00:42:53,654 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380
[2020-11-07 00:42:53,654 INFO  L87              Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 20 states.
[2020-11-07 00:42:55,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:55,595 INFO  L93              Difference]: Finished difference Result 65 states and 66 transitions.
[2020-11-07 00:42:55,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2020-11-07 00:42:55,595 INFO  L78                 Accepts]: Start accepts. Automaton has 20 states. Word has length 74
[2020-11-07 00:42:55,596 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:55,597 INFO  L225             Difference]: With dead ends: 65
[2020-11-07 00:42:55,597 INFO  L226             Difference]: Without dead ends: 59
[2020-11-07 00:42:55,599 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=161, Invalid=1819, Unknown=0, NotChecked=0, Total=1980
[2020-11-07 00:42:55,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2020-11-07 00:42:55,610 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2020-11-07 00:42:55,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2020-11-07 00:42:55,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions.
[2020-11-07 00:42:55,611 INFO  L78                 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 74
[2020-11-07 00:42:55,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:55,612 INFO  L481      AbstractCegarLoop]: Abstraction has 59 states and 60 transitions.
[2020-11-07 00:42:55,612 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 20 states.
[2020-11-07 00:42:55,612 INFO  L276                IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions.
[2020-11-07 00:42:55,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2020-11-07 00:42:55,614 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:55,614 INFO  L422         BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:55,614 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-11-07 00:42:55,614 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:55,615 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:55,615 INFO  L82        PathProgramCache]: Analyzing trace with hash 1924014913, now seen corresponding path program 8 times
[2020-11-07 00:42:55,615 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:55,616 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [756647009]
[2020-11-07 00:42:55,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:55,618 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:55,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:55,718 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:55,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:55,724 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:55,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:55,774 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:55,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:55,826 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:55,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:55,877 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:55,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:55,936 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:55,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:55,996 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:56,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:56,081 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:56,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:56,176 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:56,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:56,251 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:56,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:56,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked.
[2020-11-07 00:42:56,351 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [756647009]
[2020-11-07 00:42:56,352 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:56,352 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2020-11-07 00:42:56,353 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012528460]
[2020-11-07 00:42:56,354 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 22 states
[2020-11-07 00:42:56,358 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:56,359 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2020-11-07 00:42:56,360 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462
[2020-11-07 00:42:56,361 INFO  L87              Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 22 states.
[2020-11-07 00:42:58,573 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:42:58,574 INFO  L93              Difference]: Finished difference Result 69 states and 70 transitions.
[2020-11-07 00:42:58,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2020-11-07 00:42:58,574 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states. Word has length 81
[2020-11-07 00:42:58,575 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:42:58,576 INFO  L225             Difference]: With dead ends: 69
[2020-11-07 00:42:58,576 INFO  L226             Difference]: Without dead ends: 63
[2020-11-07 00:42:58,584 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=180, Invalid=2270, Unknown=0, NotChecked=0, Total=2450
[2020-11-07 00:42:58,585 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2020-11-07 00:42:58,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2020-11-07 00:42:58,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2020-11-07 00:42:58,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions.
[2020-11-07 00:42:58,612 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 81
[2020-11-07 00:42:58,613 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:42:58,613 INFO  L481      AbstractCegarLoop]: Abstraction has 63 states and 64 transitions.
[2020-11-07 00:42:58,613 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 22 states.
[2020-11-07 00:42:58,613 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions.
[2020-11-07 00:42:58,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2020-11-07 00:42:58,619 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:42:58,619 INFO  L422         BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:42:58,620 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-11-07 00:42:58,621 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:42:58,621 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:42:58,621 INFO  L82        PathProgramCache]: Analyzing trace with hash -1815934069, now seen corresponding path program 9 times
[2020-11-07 00:42:58,622 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:42:58,622 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [871711640]
[2020-11-07 00:42:58,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:42:58,628 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:42:58,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:58,776 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:42:58,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:58,782 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:42:58,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:58,838 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:58,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:58,888 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:58,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:58,942 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:58,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:58,997 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:59,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:59,058 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:59,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:59,148 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:59,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:59,218 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:59,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:59,291 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:59,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:59,362 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:42:59,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:42:59,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2020-11-07 00:42:59,446 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [871711640]
[2020-11-07 00:42:59,446 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:42:59,446 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2020-11-07 00:42:59,446 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181026819]
[2020-11-07 00:42:59,446 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 24 states
[2020-11-07 00:42:59,447 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:42:59,447 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2020-11-07 00:42:59,448 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552
[2020-11-07 00:42:59,448 INFO  L87              Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states.
[2020-11-07 00:43:02,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:02,043 INFO  L93              Difference]: Finished difference Result 73 states and 74 transitions.
[2020-11-07 00:43:02,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2020-11-07 00:43:02,044 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states. Word has length 88
[2020-11-07 00:43:02,045 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:02,046 INFO  L225             Difference]: With dead ends: 73
[2020-11-07 00:43:02,046 INFO  L226             Difference]: Without dead ends: 67
[2020-11-07 00:43:02,049 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=199, Invalid=2771, Unknown=0, NotChecked=0, Total=2970
[2020-11-07 00:43:02,049 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2020-11-07 00:43:02,061 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2020-11-07 00:43:02,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2020-11-07 00:43:02,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions.
[2020-11-07 00:43:02,062 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 88
[2020-11-07 00:43:02,062 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:02,063 INFO  L481      AbstractCegarLoop]: Abstraction has 67 states and 68 transitions.
[2020-11-07 00:43:02,063 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 24 states.
[2020-11-07 00:43:02,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions.
[2020-11-07 00:43:02,064 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2020-11-07 00:43:02,064 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:02,064 INFO  L422         BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:02,064 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-11-07 00:43:02,065 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:02,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:02,065 INFO  L82        PathProgramCache]: Analyzing trace with hash -1550347829, now seen corresponding path program 10 times
[2020-11-07 00:43:02,065 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:02,066 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [836810953]
[2020-11-07 00:43:02,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:02,068 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:02,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,166 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:02,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,172 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:02,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,224 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,287 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,359 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,438 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,508 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,574 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,640 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,715 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,789 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,865 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:02,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:02,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked.
[2020-11-07 00:43:02,957 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [836810953]
[2020-11-07 00:43:02,957 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:02,958 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2020-11-07 00:43:02,958 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128583952]
[2020-11-07 00:43:02,960 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 26 states
[2020-11-07 00:43:02,960 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:02,961 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2020-11-07 00:43:02,961 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650
[2020-11-07 00:43:02,962 INFO  L87              Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 26 states.
[2020-11-07 00:43:05,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:05,897 INFO  L93              Difference]: Finished difference Result 77 states and 78 transitions.
[2020-11-07 00:43:05,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2020-11-07 00:43:05,898 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states. Word has length 95
[2020-11-07 00:43:05,898 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:05,899 INFO  L225             Difference]: With dead ends: 77
[2020-11-07 00:43:05,899 INFO  L226             Difference]: Without dead ends: 71
[2020-11-07 00:43:05,902 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=218, Invalid=3322, Unknown=0, NotChecked=0, Total=3540
[2020-11-07 00:43:05,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2020-11-07 00:43:05,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2020-11-07 00:43:05,915 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 71 states.
[2020-11-07 00:43:05,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions.
[2020-11-07 00:43:05,916 INFO  L78                 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 95
[2020-11-07 00:43:05,917 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:05,917 INFO  L481      AbstractCegarLoop]: Abstraction has 71 states and 72 transitions.
[2020-11-07 00:43:05,917 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 26 states.
[2020-11-07 00:43:05,917 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions.
[2020-11-07 00:43:05,918 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2020-11-07 00:43:05,918 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:05,919 INFO  L422         BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:05,919 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-11-07 00:43:05,919 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:05,920 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:05,920 INFO  L82        PathProgramCache]: Analyzing trace with hash -1156643755, now seen corresponding path program 11 times
[2020-11-07 00:43:05,920 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:05,920 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821489152]
[2020-11-07 00:43:05,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:05,923 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:05,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,036 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:06,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,041 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:06,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,129 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,213 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,299 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,370 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,441 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,514 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,589 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,666 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,743 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,836 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:06,931 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:06,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:07,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked.
[2020-11-07 00:43:07,039 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821489152]
[2020-11-07 00:43:07,040 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:07,040 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28
[2020-11-07 00:43:07,040 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297958393]
[2020-11-07 00:43:07,040 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 28 states
[2020-11-07 00:43:07,041 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:07,041 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2020-11-07 00:43:07,042 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756
[2020-11-07 00:43:07,042 INFO  L87              Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 28 states.
[2020-11-07 00:43:10,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:10,352 INFO  L93              Difference]: Finished difference Result 81 states and 82 transitions.
[2020-11-07 00:43:10,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2020-11-07 00:43:10,353 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states. Word has length 102
[2020-11-07 00:43:10,353 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:10,354 INFO  L225             Difference]: With dead ends: 81
[2020-11-07 00:43:10,354 INFO  L226             Difference]: Without dead ends: 75
[2020-11-07 00:43:10,356 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=237, Invalid=3923, Unknown=0, NotChecked=0, Total=4160
[2020-11-07 00:43:10,357 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2020-11-07 00:43:10,368 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2020-11-07 00:43:10,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2020-11-07 00:43:10,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions.
[2020-11-07 00:43:10,369 INFO  L78                 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 102
[2020-11-07 00:43:10,370 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:10,370 INFO  L481      AbstractCegarLoop]: Abstraction has 75 states and 76 transitions.
[2020-11-07 00:43:10,370 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 28 states.
[2020-11-07 00:43:10,370 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions.
[2020-11-07 00:43:10,371 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2020-11-07 00:43:10,371 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:10,372 INFO  L422         BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:10,372 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-11-07 00:43:10,372 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:10,373 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:10,373 INFO  L82        PathProgramCache]: Analyzing trace with hash 1249349205, now seen corresponding path program 12 times
[2020-11-07 00:43:10,373 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:10,373 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [871022083]
[2020-11-07 00:43:10,373 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:10,376 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:10,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,480 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:10,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,486 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:10,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,546 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:10,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,611 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:10,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,683 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:10,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,767 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:10,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,857 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:10,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:10,965 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:10,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:11,044 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:11,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:11,132 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:11,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:11,215 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:11,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:11,302 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:11,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:11,388 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:11,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:11,479 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:11,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:11,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked.
[2020-11-07 00:43:11,616 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [871022083]
[2020-11-07 00:43:11,616 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:11,616 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30
[2020-11-07 00:43:11,617 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328836307]
[2020-11-07 00:43:11,617 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 30 states
[2020-11-07 00:43:11,617 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:11,618 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2020-11-07 00:43:11,618 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870
[2020-11-07 00:43:11,618 INFO  L87              Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 30 states.
[2020-11-07 00:43:15,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:15,327 INFO  L93              Difference]: Finished difference Result 85 states and 86 transitions.
[2020-11-07 00:43:15,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. 
[2020-11-07 00:43:15,327 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states. Word has length 109
[2020-11-07 00:43:15,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:15,329 INFO  L225             Difference]: With dead ends: 85
[2020-11-07 00:43:15,329 INFO  L226             Difference]: Without dead ends: 79
[2020-11-07 00:43:15,332 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=256, Invalid=4574, Unknown=0, NotChecked=0, Total=4830
[2020-11-07 00:43:15,332 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2020-11-07 00:43:15,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2020-11-07 00:43:15,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 79 states.
[2020-11-07 00:43:15,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions.
[2020-11-07 00:43:15,346 INFO  L78                 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 109
[2020-11-07 00:43:15,346 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:15,346 INFO  L481      AbstractCegarLoop]: Abstraction has 79 states and 80 transitions.
[2020-11-07 00:43:15,346 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 30 states.
[2020-11-07 00:43:15,347 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions.
[2020-11-07 00:43:15,348 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2020-11-07 00:43:15,348 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:15,348 INFO  L422         BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:15,348 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-11-07 00:43:15,348 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:15,349 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:15,349 INFO  L82        PathProgramCache]: Analyzing trace with hash 46324511, now seen corresponding path program 13 times
[2020-11-07 00:43:15,349 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:15,349 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1148801115]
[2020-11-07 00:43:15,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:15,352 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:15,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,459 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:15,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,464 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:15,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,522 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:15,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,591 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:15,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,657 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:15,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,724 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:15,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,795 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:15,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,869 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:15,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:15,941 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:15,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:16,021 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:16,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:16,107 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:16,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:16,204 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:16,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:16,311 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:16,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:16,418 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:16,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:16,530 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:16,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:16,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked.
[2020-11-07 00:43:16,657 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1148801115]
[2020-11-07 00:43:16,657 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:16,658 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2020-11-07 00:43:16,658 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795661682]
[2020-11-07 00:43:16,658 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 32 states
[2020-11-07 00:43:16,658 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:16,659 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2020-11-07 00:43:16,659 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992
[2020-11-07 00:43:16,660 INFO  L87              Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 32 states.
[2020-11-07 00:43:20,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:20,847 INFO  L93              Difference]: Finished difference Result 89 states and 90 transitions.
[2020-11-07 00:43:20,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2020-11-07 00:43:20,847 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states. Word has length 116
[2020-11-07 00:43:20,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:20,849 INFO  L225             Difference]: With dead ends: 89
[2020-11-07 00:43:20,849 INFO  L226             Difference]: Without dead ends: 83
[2020-11-07 00:43:20,852 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=275, Invalid=5275, Unknown=0, NotChecked=0, Total=5550
[2020-11-07 00:43:20,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2020-11-07 00:43:20,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2020-11-07 00:43:20,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2020-11-07 00:43:20,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions.
[2020-11-07 00:43:20,865 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 116
[2020-11-07 00:43:20,865 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:20,865 INFO  L481      AbstractCegarLoop]: Abstraction has 83 states and 84 transitions.
[2020-11-07 00:43:20,866 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 32 states.
[2020-11-07 00:43:20,866 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions.
[2020-11-07 00:43:20,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2020-11-07 00:43:20,867 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:20,867 INFO  L422         BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:20,867 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-11-07 00:43:20,867 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:20,868 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:20,868 INFO  L82        PathProgramCache]: Analyzing trace with hash 322836703, now seen corresponding path program 14 times
[2020-11-07 00:43:20,874 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:20,874 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1991430948]
[2020-11-07 00:43:20,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:20,879 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:20,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,035 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:21,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,040 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:21,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,116 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,190 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,270 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,341 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,418 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,486 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,562 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,637 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,720 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,822 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:21,960 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:21,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:22,098 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:22,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:22,238 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:22,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:22,396 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:22,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:22,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked.
[2020-11-07 00:43:22,609 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1991430948]
[2020-11-07 00:43:22,610 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:22,610 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34
[2020-11-07 00:43:22,610 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324455395]
[2020-11-07 00:43:22,611 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 34 states
[2020-11-07 00:43:22,611 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:22,612 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2020-11-07 00:43:22,612 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122
[2020-11-07 00:43:22,613 INFO  L87              Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 34 states.
[2020-11-07 00:43:27,255 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:27,255 INFO  L93              Difference]: Finished difference Result 93 states and 94 transitions.
[2020-11-07 00:43:27,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. 
[2020-11-07 00:43:27,256 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states. Word has length 123
[2020-11-07 00:43:27,257 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:27,258 INFO  L225             Difference]: With dead ends: 93
[2020-11-07 00:43:27,258 INFO  L226             Difference]: Without dead ends: 87
[2020-11-07 00:43:27,261 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=294, Invalid=6026, Unknown=0, NotChecked=0, Total=6320
[2020-11-07 00:43:27,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2020-11-07 00:43:27,271 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87.
[2020-11-07 00:43:27,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2020-11-07 00:43:27,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions.
[2020-11-07 00:43:27,272 INFO  L78                 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 123
[2020-11-07 00:43:27,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:27,273 INFO  L481      AbstractCegarLoop]: Abstraction has 87 states and 88 transitions.
[2020-11-07 00:43:27,273 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 34 states.
[2020-11-07 00:43:27,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions.
[2020-11-07 00:43:27,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2020-11-07 00:43:27,274 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:27,274 INFO  L422         BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:27,274 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-11-07 00:43:27,275 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:27,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:27,275 INFO  L82        PathProgramCache]: Analyzing trace with hash 1510117353, now seen corresponding path program 15 times
[2020-11-07 00:43:27,275 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:27,276 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414774758]
[2020-11-07 00:43:27,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:27,278 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:27,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,393 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:27,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,399 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:27,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,477 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:27,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,551 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:27,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,649 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:27,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,729 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:27,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,806 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:27,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,884 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:27,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:27,961 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:27,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,047 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,130 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,215 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,305 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,396 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,511 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,646 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,790 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:28,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:28,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked.
[2020-11-07 00:43:28,996 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414774758]
[2020-11-07 00:43:28,996 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:28,996 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2020-11-07 00:43:28,996 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666455226]
[2020-11-07 00:43:28,997 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 36 states
[2020-11-07 00:43:28,997 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:28,997 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2020-11-07 00:43:28,998 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260
[2020-11-07 00:43:28,998 INFO  L87              Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 36 states.
[2020-11-07 00:43:34,171 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:34,172 INFO  L93              Difference]: Finished difference Result 97 states and 98 transitions.
[2020-11-07 00:43:34,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. 
[2020-11-07 00:43:34,172 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states. Word has length 130
[2020-11-07 00:43:34,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:34,174 INFO  L225             Difference]: With dead ends: 97
[2020-11-07 00:43:34,174 INFO  L226             Difference]: Without dead ends: 91
[2020-11-07 00:43:34,178 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=313, Invalid=6827, Unknown=0, NotChecked=0, Total=7140
[2020-11-07 00:43:34,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2020-11-07 00:43:34,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2020-11-07 00:43:34,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2020-11-07 00:43:34,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions.
[2020-11-07 00:43:34,190 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 130
[2020-11-07 00:43:34,191 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:34,191 INFO  L481      AbstractCegarLoop]: Abstraction has 91 states and 92 transitions.
[2020-11-07 00:43:34,191 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 36 states.
[2020-11-07 00:43:34,191 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions.
[2020-11-07 00:43:34,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2020-11-07 00:43:34,192 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:34,192 INFO  L422         BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:34,192 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-11-07 00:43:34,193 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:34,193 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:34,193 INFO  L82        PathProgramCache]: Analyzing trace with hash -1118097047, now seen corresponding path program 16 times
[2020-11-07 00:43:34,193 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:34,194 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006483309]
[2020-11-07 00:43:34,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:34,196 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:34,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,310 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:34,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,314 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:34,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,380 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,446 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,517 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,590 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,668 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,747 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,835 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,845 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:34,919 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:34,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,002 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,093 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,188 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,294 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,390 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,490 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,592 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,712 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:35,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:35,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2020-11-07 00:43:35,874 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006483309]
[2020-11-07 00:43:35,874 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:35,874 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38
[2020-11-07 00:43:35,874 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991271409]
[2020-11-07 00:43:35,875 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 38 states
[2020-11-07 00:43:35,875 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:35,875 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2020-11-07 00:43:35,876 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406
[2020-11-07 00:43:35,876 INFO  L87              Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 38 states.
[2020-11-07 00:43:41,707 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:41,708 INFO  L93              Difference]: Finished difference Result 101 states and 102 transitions.
[2020-11-07 00:43:41,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. 
[2020-11-07 00:43:41,717 INFO  L78                 Accepts]: Start accepts. Automaton has 38 states. Word has length 137
[2020-11-07 00:43:41,718 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:41,719 INFO  L225             Difference]: With dead ends: 101
[2020-11-07 00:43:41,719 INFO  L226             Difference]: Without dead ends: 95
[2020-11-07 00:43:41,721 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=332, Invalid=7678, Unknown=0, NotChecked=0, Total=8010
[2020-11-07 00:43:41,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2020-11-07 00:43:41,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2020-11-07 00:43:41,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2020-11-07 00:43:41,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions.
[2020-11-07 00:43:41,734 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 137
[2020-11-07 00:43:41,734 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:41,734 INFO  L481      AbstractCegarLoop]: Abstraction has 95 states and 96 transitions.
[2020-11-07 00:43:41,734 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 38 states.
[2020-11-07 00:43:41,734 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions.
[2020-11-07 00:43:41,735 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2020-11-07 00:43:41,736 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:41,736 INFO  L422         BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:41,736 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-11-07 00:43:41,736 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:41,736 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:41,737 INFO  L82        PathProgramCache]: Analyzing trace with hash 1483874995, now seen corresponding path program 17 times
[2020-11-07 00:43:41,737 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:41,737 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1609875393]
[2020-11-07 00:43:41,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:41,739 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:41,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:41,852 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:41,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:41,856 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:41,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:41,934 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:41,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,007 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,081 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,158 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,234 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,313 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,396 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,489 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,575 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,666 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,754 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,871 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:42,981 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:42,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:43,081 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:43,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:43,192 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:43,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:43,296 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:43,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:43,408 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:43,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:43,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked.
[2020-11-07 00:43:43,594 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1609875393]
[2020-11-07 00:43:43,594 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:43,594 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40
[2020-11-07 00:43:43,594 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276678521]
[2020-11-07 00:43:43,594 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 40 states
[2020-11-07 00:43:43,595 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:43,595 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2020-11-07 00:43:43,595 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560
[2020-11-07 00:43:43,595 INFO  L87              Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 40 states.
[2020-11-07 00:43:49,945 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:49,945 INFO  L93              Difference]: Finished difference Result 105 states and 106 transitions.
[2020-11-07 00:43:49,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. 
[2020-11-07 00:43:49,951 INFO  L78                 Accepts]: Start accepts. Automaton has 40 states. Word has length 144
[2020-11-07 00:43:49,952 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:49,953 INFO  L225             Difference]: With dead ends: 105
[2020-11-07 00:43:49,953 INFO  L226             Difference]: Without dead ends: 99
[2020-11-07 00:43:49,954 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=351, Invalid=8579, Unknown=0, NotChecked=0, Total=8930
[2020-11-07 00:43:49,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2020-11-07 00:43:49,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99.
[2020-11-07 00:43:49,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 99 states.
[2020-11-07 00:43:49,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions.
[2020-11-07 00:43:49,973 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144
[2020-11-07 00:43:49,973 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:49,973 INFO  L481      AbstractCegarLoop]: Abstraction has 99 states and 100 transitions.
[2020-11-07 00:43:49,973 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 40 states.
[2020-11-07 00:43:49,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions.
[2020-11-07 00:43:49,976 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2020-11-07 00:43:49,976 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:49,976 INFO  L422         BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:49,976 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-11-07 00:43:49,976 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:49,977 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:49,977 INFO  L82        PathProgramCache]: Analyzing trace with hash 2076104691, now seen corresponding path program 18 times
[2020-11-07 00:43:49,977 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:49,979 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [995374987]
[2020-11-07 00:43:49,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:49,980 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:50,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,095 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:50,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,099 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:50,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,167 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,240 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,313 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,388 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,491 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,568 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,649 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,729 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,820 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:50,916 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:50,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,025 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,136 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,245 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,358 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,465 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,469 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,577 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,704 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:51,840 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:51,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:52,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked.
[2020-11-07 00:43:52,047 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [995374987]
[2020-11-07 00:43:52,047 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:43:52,047 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42
[2020-11-07 00:43:52,047 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424512017]
[2020-11-07 00:43:52,048 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 42 states
[2020-11-07 00:43:52,048 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:43:52,048 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2020-11-07 00:43:52,048 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722
[2020-11-07 00:43:52,049 INFO  L87              Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 42 states.
[2020-11-07 00:43:58,912 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:43:58,912 INFO  L93              Difference]: Finished difference Result 109 states and 110 transitions.
[2020-11-07 00:43:58,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. 
[2020-11-07 00:43:58,913 INFO  L78                 Accepts]: Start accepts. Automaton has 42 states. Word has length 151
[2020-11-07 00:43:58,914 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:43:58,915 INFO  L225             Difference]: With dead ends: 109
[2020-11-07 00:43:58,915 INFO  L226             Difference]: Without dead ends: 103
[2020-11-07 00:43:58,917 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=370, Invalid=9530, Unknown=0, NotChecked=0, Total=9900
[2020-11-07 00:43:58,918 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2020-11-07 00:43:58,926 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103.
[2020-11-07 00:43:58,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 103 states.
[2020-11-07 00:43:58,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions.
[2020-11-07 00:43:58,928 INFO  L78                 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 151
[2020-11-07 00:43:58,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:43:58,928 INFO  L481      AbstractCegarLoop]: Abstraction has 103 states and 104 transitions.
[2020-11-07 00:43:58,928 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 42 states.
[2020-11-07 00:43:58,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions.
[2020-11-07 00:43:58,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2020-11-07 00:43:58,929 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:43:58,929 INFO  L422         BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:43:58,930 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-11-07 00:43:58,930 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:43:58,930 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:43:58,930 INFO  L82        PathProgramCache]: Analyzing trace with hash -566914179, now seen corresponding path program 19 times
[2020-11-07 00:43:58,930 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:43:58,931 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723927698]
[2020-11-07 00:43:58,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:43:58,933 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:43:58,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,040 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 00:43:59,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,048 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 00:43:59,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,126 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,203 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,286 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,362 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,439 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,528 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,620 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,718 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,820 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:43:59,915 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:43:59,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,013 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,123 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,245 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,354 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,476 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,605 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,740 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,873 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:00,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:00,999 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 00:44:01,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 00:44:01,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked.
[2020-11-07 00:44:01,247 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [723927698]
[2020-11-07 00:44:01,247 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 00:44:01,247 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44
[2020-11-07 00:44:01,247 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204207215]
[2020-11-07 00:44:01,248 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 44 states
[2020-11-07 00:44:01,248 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 00:44:01,248 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2020-11-07 00:44:01,249 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892
[2020-11-07 00:44:01,249 INFO  L87              Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 44 states.
[2020-11-07 00:44:08,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 00:44:08,821 INFO  L93              Difference]: Finished difference Result 113 states and 114 transitions.
[2020-11-07 00:44:08,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. 
[2020-11-07 00:44:08,822 INFO  L78                 Accepts]: Start accepts. Automaton has 44 states. Word has length 158
[2020-11-07 00:44:08,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 00:44:08,824 INFO  L225             Difference]: With dead ends: 113
[2020-11-07 00:44:08,824 INFO  L226             Difference]: Without dead ends: 107
[2020-11-07 00:44:08,826 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=389, Invalid=10531, Unknown=0, NotChecked=0, Total=10920
[2020-11-07 00:44:08,826 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2020-11-07 00:44:08,838 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2020-11-07 00:44:08,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2020-11-07 00:44:08,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions.
[2020-11-07 00:44:08,839 INFO  L78                 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 158
[2020-11-07 00:44:08,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-07 00:44:08,840 INFO  L481      AbstractCegarLoop]: Abstraction has 107 states and 108 transitions.
[2020-11-07 00:44:08,840 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 44 states.
[2020-11-07 00:44:08,840 INFO  L276                IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions.
[2020-11-07 00:44:08,841 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2020-11-07 00:44:08,841 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-07 00:44:08,841 INFO  L422         BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 00:44:08,841 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-11-07 00:44:08,842 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 00:44:08,842 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 00:44:08,842 INFO  L82        PathProgramCache]: Analyzing trace with hash 1423510653, now seen corresponding path program 20 times
[2020-11-07 00:44:08,842 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 00:44:08,842 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1604590020]
[2020-11-07 00:44:08,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 00:44:08,845 INFO  L328   leratedInterpolation]: No loops in this trace, falling back to nested interpolation
[2020-11-07 00:44:08,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-07 00:44:08,989 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-07 00:44:09,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-07 00:44:09,118 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-07 00:44:09,194 INFO  L173   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace
[2020-11-07 00:44:09,195 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-11-07 00:44:09,198 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-11-07 00:44:09,240 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:44:09 BoogieIcfgContainer
[2020-11-07 00:44:09,240 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-11-07 00:44:09,249 INFO  L168              Benchmark]: Toolchain (without parser) took 86703.73 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 127.7 MB in the beginning and 130.9 MB in the end (delta: -3.2 MB). Peak memory consumption was 182.5 MB. Max. memory is 8.0 GB.
[2020-11-07 00:44:09,250 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2020-11-07 00:44:09,253 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 231.37 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 117.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB.
[2020-11-07 00:44:09,255 INFO  L168              Benchmark]: Boogie Preprocessor took 38.06 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
[2020-11-07 00:44:09,255 INFO  L168              Benchmark]: RCFGBuilder took 468.87 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 103.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB.
[2020-11-07 00:44:09,256 INFO  L168              Benchmark]: TraceAbstraction took 85953.20 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 103.1 MB in the beginning and 130.9 MB in the end (delta: -27.7 MB). Peak memory consumption was 158.3 MB. Max. memory is 8.0 GB.
[2020-11-07 00:44:09,264 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB.
 * CACSL2BoogieTranslator took 231.37 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 117.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB.
 * Boogie Preprocessor took 38.06 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
 * RCFGBuilder took 468.87 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 103.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB.
 * TraceAbstraction took 85953.20 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 103.1 MB in the beginning and 130.9 MB in the end (delta: -27.7 MB). Peak memory consumption was 158.3 MB. Max. memory is 8.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L12]              unsigned int input = __VERIFIER_nondet_uint();
[L13]  CALL, EXPR  id(input)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND FALSE  !(x==0)
[L8]   CALL, EXPR  id(x-1)
[L7]   COND TRUE   x==0
[L7]               return 0;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L8]   RET, EXPR   id(x-1)
[L8]               return id(x-1) + 1;
[L13]  RET, EXPR   id(input)
[L13]              unsigned int result = id(input);
[L14]  COND TRUE   result == 20
[L15]  CALL        reach_error()
[L4]               __assert_fail("0", "id_o20.c", 4, "reach_error")

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 85.8s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 63.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 885 SDtfs, 1106 SDslu, 6667 SDs, 0 SdLazy, 27368 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1590 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 1110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13020 ImplicationChecksByTransitivity, 53.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...