/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i


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


This is Ultimate 0.2.1-dev-1a84f73
[2021-05-01 07:07:51,586 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-05-01 07:07:51,589 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-05-01 07:07:51,632 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-05-01 07:07:51,632 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-05-01 07:07:51,635 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-05-01 07:07:51,638 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-05-01 07:07:51,643 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-05-01 07:07:51,645 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-05-01 07:07:51,649 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-05-01 07:07:51,650 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-05-01 07:07:51,651 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-05-01 07:07:51,651 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-05-01 07:07:51,653 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-05-01 07:07:51,654 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-05-01 07:07:51,657 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-05-01 07:07:51,660 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-05-01 07:07:51,661 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-05-01 07:07:51,663 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-05-01 07:07:51,668 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-05-01 07:07:51,669 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-05-01 07:07:51,671 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-05-01 07:07:51,671 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-05-01 07:07:51,672 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-05-01 07:07:51,674 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-05-01 07:07:51,674 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-05-01 07:07:51,675 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-05-01 07:07:51,675 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-05-01 07:07:51,676 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-05-01 07:07:51,676 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-05-01 07:07:51,677 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-05-01 07:07:51,677 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-05-01 07:07:51,678 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-05-01 07:07:51,679 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-05-01 07:07:51,679 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-05-01 07:07:51,680 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-05-01 07:07:51,680 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-05-01 07:07:51,684 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-05-01 07:07:51,685 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-05-01 07:07:51,686 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-05-01 07:07:51,686 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-05-01 07:07:51,688 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2021-05-01 07:07:51,696 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-05-01 07:07:51,697 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-05-01 07:07:51,698 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-05-01 07:07:51,698 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-05-01 07:07:51,698 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-05-01 07:07:51,698 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-05-01 07:07:51,698 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-05-01 07:07:51,698 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-05-01 07:07:51,699 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-05-01 07:07:51,699 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-05-01 07:07:51,699 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-05-01 07:07:51,699 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-05-01 07:07:51,699 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-05-01 07:07:51,699 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-05-01 07:07:51,699 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-05-01 07:07:51,700 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-05-01 07:07:51,700 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-05-01 07:07:51,700 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-05-01 07:07:51,700 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-05-01 07:07:51,700 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-05-01 07:07:51,705 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2021-05-01 07:07:51,705 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-05-01 07:07:51,706 INFO  L138        SettingsManager]:  * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2021-05-01 07:07:51,706 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
[2021-05-01 07:07:52,065 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-05-01 07:07:52,092 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-05-01 07:07:52,095 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-05-01 07:07:52,096 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-05-01 07:07:52,097 INFO  L275        PluginConnector]: CDTParser initialized
[2021-05-01 07:07:52,099 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i
[2021-05-01 07:07:52,168 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030119a1b/df35dca3cf8844aca99912b6d8f0694d/FLAG93f708fc7
[2021-05-01 07:07:52,672 INFO  L306              CDTParser]: Found 1 translation units.
[2021-05-01 07:07:52,673 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i
[2021-05-01 07:07:52,680 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030119a1b/df35dca3cf8844aca99912b6d8f0694d/FLAG93f708fc7
[2021-05-01 07:07:53,154 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030119a1b/df35dca3cf8844aca99912b6d8f0694d
[2021-05-01 07:07:53,157 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-05-01 07:07:53,160 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2021-05-01 07:07:53,164 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-05-01 07:07:53,164 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-05-01 07:07:53,167 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-05-01 07:07:53,168 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,169 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3974817b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53, skipping insertion in model container
[2021-05-01 07:07:53,169 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,175 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-05-01 07:07:53,192 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-05-01 07:07:53,315 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i[919,932]
[2021-05-01 07:07:53,332 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-05-01 07:07:53,339 INFO  L203         MainTranslator]: Completed pre-run
[2021-05-01 07:07:53,395 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i[919,932]
[2021-05-01 07:07:53,402 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-05-01 07:07:53,415 INFO  L208         MainTranslator]: Completed translation
[2021-05-01 07:07:53,416 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53 WrapperNode
[2021-05-01 07:07:53,416 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-05-01 07:07:53,417 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-05-01 07:07:53,417 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-05-01 07:07:53,417 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-05-01 07:07:53,426 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,426 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,432 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,433 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,438 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,442 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,443 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (1/1) ...
[2021-05-01 07:07:53,445 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-05-01 07:07:53,446 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-05-01 07:07:53,446 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-05-01 07:07:53,446 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-05-01 07:07:53,447 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (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
[2021-05-01 07:07:53,528 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2021-05-01 07:07:53,528 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-05-01 07:07:53,528 INFO  L138     BoogieDeclarations]: Found implementation of procedure reach_error
[2021-05-01 07:07:53,529 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2021-05-01 07:07:53,529 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2021-05-01 07:07:53,529 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2021-05-01 07:07:53,529 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2021-05-01 07:07:53,530 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert_fail
[2021-05-01 07:07:53,530 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert_perror_fail
[2021-05-01 07:07:53,530 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert
[2021-05-01 07:07:53,530 INFO  L130     BoogieDeclarations]: Found specification of procedure reach_error
[2021-05-01 07:07:53,530 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-05-01 07:07:53,531 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2021-05-01 07:07:53,531 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2021-05-01 07:07:53,531 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2021-05-01 07:07:53,531 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2021-05-01 07:07:53,531 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2021-05-01 07:07:53,532 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-05-01 07:07:53,532 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2021-05-01 07:07:53,534 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-05-01 07:07:53,534 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-05-01 07:07:53,534 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-05-01 07:07:53,897 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-05-01 07:07:53,897 INFO  L299             CfgBuilder]: Removed 2 assume(true) statements.
[2021-05-01 07:07:53,898 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:07:53 BoogieIcfgContainer
[2021-05-01 07:07:53,898 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-05-01 07:07:53,900 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-05-01 07:07:53,900 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-05-01 07:07:53,902 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-05-01 07:07:53,903 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.05 07:07:53" (1/3) ...
[2021-05-01 07:07:53,903 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce8190f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:07:53, skipping insertion in model container
[2021-05-01 07:07:53,903 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:07:53" (2/3) ...
[2021-05-01 07:07:53,904 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce8190f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:07:53, skipping insertion in model container
[2021-05-01 07:07:53,904 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:07:53" (3/3) ...
[2021-05-01 07:07:53,913 INFO  L111   eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i
[2021-05-01 07:07:53,919 INFO  L149   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION
[2021-05-01 07:07:53,922 INFO  L161   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2021-05-01 07:07:53,938 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-05-01 07:07:53,957 INFO  L376      AbstractCegarLoop]: Interprodecural is true
[2021-05-01 07:07:53,957 INFO  L377      AbstractCegarLoop]: Hoare is true
[2021-05-01 07:07:53,957 INFO  L378      AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation
[2021-05-01 07:07:53,958 INFO  L379      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-05-01 07:07:53,958 INFO  L380      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-05-01 07:07:53,958 INFO  L381      AbstractCegarLoop]: Difference is false
[2021-05-01 07:07:53,958 INFO  L382      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-05-01 07:07:53,958 INFO  L386      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-05-01 07:07:53,971 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 33 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2021-05-01 07:07:53,978 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2021-05-01 07:07:53,978 INFO  L511         BasicCegarLoop]: Found error trace
[2021-05-01 07:07:53,979 INFO  L519         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-01 07:07:53,980 INFO  L428      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-05-01 07:07:53,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-05-01 07:07:53,991 INFO  L82        PathProgramCache]: Analyzing trace with hash -2103477690, now seen corresponding path program 1 times
[2021-05-01 07:07:53,997 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2021-05-01 07:07:53,997 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [998022384]
[2021-05-01 07:07:53,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-05-01 07:07:54,042 INFO  L224   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2021-05-01 07:07:54,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,167 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,174 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,175 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,176 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,237 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-05-01 07:07:54,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,278 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,279 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,280 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-05-01 07:07:54,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,286 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,287 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,288 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,289 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,289 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-05-01 07:07:54,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,295 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,295 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,297 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,298 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2021-05-01 07:07:54,300 INFO  L179   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2021-05-01 07:07:54,301 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [998022384]
[2021-05-01 07:07:54,302 INFO  L200   FreeRefinementEngine]: IpTcStrategyModulePreferences [998022384] provided 1 perfect and 0 imperfect interpolant sequences
[2021-05-01 07:07:54,302 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-05-01 07:07:54,303 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-05-01 07:07:54,303 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115178788]
[2021-05-01 07:07:54,307 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-05-01 07:07:54,308 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2021-05-01 07:07:54,319 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-05-01 07:07:54,320 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-05-01 07:07:54,322 INFO  L87              Difference]: Start difference. First operand  has 33 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2021-05-01 07:07:54,505 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-05-01 07:07:54,505 INFO  L93              Difference]: Finished difference Result 59 states and 81 transitions.
[2021-05-01 07:07:54,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-05-01 07:07:54,507 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2021-05-01 07:07:54,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-05-01 07:07:54,514 INFO  L225             Difference]: With dead ends: 59
[2021-05-01 07:07:54,515 INFO  L226             Difference]: Without dead ends: 28
[2021-05-01 07:07:54,519 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-05-01 07:07:54,532 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2021-05-01 07:07:54,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2021-05-01 07:07:54,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2021-05-01 07:07:54,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2021-05-01 07:07:54,571 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22
[2021-05-01 07:07:54,572 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-05-01 07:07:54,572 INFO  L480      AbstractCegarLoop]: Abstraction has 28 states and 32 transitions.
[2021-05-01 07:07:54,572 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2021-05-01 07:07:54,573 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions.
[2021-05-01 07:07:54,574 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2021-05-01 07:07:54,575 INFO  L511         BasicCegarLoop]: Found error trace
[2021-05-01 07:07:54,575 INFO  L519         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-01 07:07:54,575 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-05-01 07:07:54,576 INFO  L428      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-05-01 07:07:54,576 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-05-01 07:07:54,577 INFO  L82        PathProgramCache]: Analyzing trace with hash 371025730, now seen corresponding path program 1 times
[2021-05-01 07:07:54,577 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2021-05-01 07:07:54,578 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [561389775]
[2021-05-01 07:07:54,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-05-01 07:07:54,586 INFO  L224   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2021-05-01 07:07:54,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,700 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,701 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,703 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,704 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-05-01 07:07:54,709 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,710 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-05-01 07:07:54,715 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,716 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-05-01 07:07:54,727 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,727 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:54,734 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,735 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:54,742 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,743 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,767 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-05-01 07:07:54,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,774 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,775 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:54,775 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-05-01 07:07:54,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,784 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,784 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-05-01 07:07:54,795 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,796 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:54,806 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-05-01 07:07:54,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:54,816 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,817 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-05-01 07:07:54,817 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:54,818 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:54,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2021-05-01 07:07:54,819 INFO  L179   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2021-05-01 07:07:54,819 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [561389775]
[2021-05-01 07:07:54,819 INFO  L200   FreeRefinementEngine]: IpTcStrategyModulePreferences [561389775] provided 1 perfect and 0 imperfect interpolant sequences
[2021-05-01 07:07:54,819 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-05-01 07:07:54,819 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-05-01 07:07:54,820 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030881596]
[2021-05-01 07:07:54,820 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-05-01 07:07:54,820 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2021-05-01 07:07:54,821 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-05-01 07:07:54,821 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2021-05-01 07:07:54,822 INFO  L87              Difference]: Start difference. First operand 28 states and 32 transitions. Second operand  has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2021-05-01 07:07:55,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-05-01 07:07:55,204 INFO  L93              Difference]: Finished difference Result 43 states and 50 transitions.
[2021-05-01 07:07:55,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-05-01 07:07:55,205 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2021-05-01 07:07:55,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-05-01 07:07:55,206 INFO  L225             Difference]: With dead ends: 43
[2021-05-01 07:07:55,206 INFO  L226             Difference]: Without dead ends: 41
[2021-05-01 07:07:55,208 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 227.3ms TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182
[2021-05-01 07:07:55,208 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2021-05-01 07:07:55,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34.
[2021-05-01 07:07:55,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2021-05-01 07:07:55,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions.
[2021-05-01 07:07:55,219 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 22
[2021-05-01 07:07:55,220 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-05-01 07:07:55,220 INFO  L480      AbstractCegarLoop]: Abstraction has 34 states and 39 transitions.
[2021-05-01 07:07:55,220 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2021-05-01 07:07:55,220 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions.
[2021-05-01 07:07:55,221 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2021-05-01 07:07:55,221 INFO  L511         BasicCegarLoop]: Found error trace
[2021-05-01 07:07:55,221 INFO  L519         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-01 07:07:55,221 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-05-01 07:07:55,222 INFO  L428      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-05-01 07:07:55,222 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-05-01 07:07:55,222 INFO  L82        PathProgramCache]: Analyzing trace with hash 1433932453, now seen corresponding path program 1 times
[2021-05-01 07:07:55,222 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2021-05-01 07:07:55,223 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1131330307]
[2021-05-01 07:07:55,223 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-05-01 07:07:55,225 INFO  L224   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2021-05-01 07:07:55,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,257 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,258 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,258 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,259 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-05-01 07:07:55,262 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,263 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,280 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-05-01 07:07:55,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,288 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,288 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,289 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-05-01 07:07:55,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,294 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,295 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,295 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-05-01 07:07:55,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,300 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,301 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2021-05-01 07:07:55,302 INFO  L179   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2021-05-01 07:07:55,302 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1131330307]
[2021-05-01 07:07:55,302 INFO  L200   FreeRefinementEngine]: IpTcStrategyModulePreferences [1131330307] provided 1 perfect and 0 imperfect interpolant sequences
[2021-05-01 07:07:55,302 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-05-01 07:07:55,302 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-05-01 07:07:55,302 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704540762]
[2021-05-01 07:07:55,303 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-05-01 07:07:55,303 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2021-05-01 07:07:55,303 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-05-01 07:07:55,303 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-05-01 07:07:55,304 INFO  L87              Difference]: Start difference. First operand 34 states and 39 transitions. Second operand  has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2021-05-01 07:07:55,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-05-01 07:07:55,385 INFO  L93              Difference]: Finished difference Result 47 states and 53 transitions.
[2021-05-01 07:07:55,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-05-01 07:07:55,386 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24
[2021-05-01 07:07:55,386 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-05-01 07:07:55,387 INFO  L225             Difference]: With dead ends: 47
[2021-05-01 07:07:55,387 INFO  L226             Difference]: Without dead ends: 37
[2021-05-01 07:07:55,387 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-05-01 07:07:55,388 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2021-05-01 07:07:55,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34.
[2021-05-01 07:07:55,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2021-05-01 07:07:55,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions.
[2021-05-01 07:07:55,396 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24
[2021-05-01 07:07:55,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-05-01 07:07:55,397 INFO  L480      AbstractCegarLoop]: Abstraction has 34 states and 38 transitions.
[2021-05-01 07:07:55,397 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2021-05-01 07:07:55,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions.
[2021-05-01 07:07:55,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2021-05-01 07:07:55,398 INFO  L511         BasicCegarLoop]: Found error trace
[2021-05-01 07:07:55,398 INFO  L519         BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-01 07:07:55,398 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-05-01 07:07:55,398 INFO  L428      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-05-01 07:07:55,399 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-05-01 07:07:55,399 INFO  L82        PathProgramCache]: Analyzing trace with hash -1366441036, now seen corresponding path program 1 times
[2021-05-01 07:07:55,399 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2021-05-01 07:07:55,399 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [161318188]
[2021-05-01 07:07:55,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-05-01 07:07:55,405 INFO  L224   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2021-05-01 07:07:55,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,543 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,544 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,545 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,545 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-05-01 07:07:55,549 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,550 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-05-01 07:07:55,557 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 63.0 percent of original size
[2021-05-01 07:07:55,557 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-05-01 07:07:55,568 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 77.8 percent of original size
[2021-05-01 07:07:55,569 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35
[2021-05-01 07:07:55,588 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,589 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37
[2021-05-01 07:07:55,613 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,614 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-05-01 07:07:55,627 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,628 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:55,635 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,635 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:55,642 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,643 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,666 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-05-01 07:07:55,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,687 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,688 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,688 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-05-01 07:07:55,689 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,696 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,696 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,697 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-05-01 07:07:55,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,706 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,706 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-05-01 07:07:55,716 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,717 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:55,734 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-05-01 07:07:55,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,749 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,750 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,750 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2021-05-01 07:07:55,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:55,764 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:55,765 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:55,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2021-05-01 07:07:55,766 INFO  L179   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2021-05-01 07:07:55,766 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [161318188]
[2021-05-01 07:07:55,766 INFO  L200   FreeRefinementEngine]: IpTcStrategyModulePreferences [161318188] provided 1 perfect and 0 imperfect interpolant sequences
[2021-05-01 07:07:55,766 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-05-01 07:07:55,766 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-05-01 07:07:55,766 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423869522]
[2021-05-01 07:07:55,767 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-05-01 07:07:55,767 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2021-05-01 07:07:55,767 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-05-01 07:07:55,768 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2021-05-01 07:07:55,768 INFO  L87              Difference]: Start difference. First operand 34 states and 38 transitions. Second operand  has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2021-05-01 07:07:56,199 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-05-01 07:07:56,200 INFO  L93              Difference]: Finished difference Result 49 states and 55 transitions.
[2021-05-01 07:07:56,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-05-01 07:07:56,201 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35
[2021-05-01 07:07:56,201 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-05-01 07:07:56,203 INFO  L225             Difference]: With dead ends: 49
[2021-05-01 07:07:56,204 INFO  L226             Difference]: Without dead ends: 47
[2021-05-01 07:07:56,205 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 285.1ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272
[2021-05-01 07:07:56,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2021-05-01 07:07:56,212 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33.
[2021-05-01 07:07:56,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2021-05-01 07:07:56,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions.
[2021-05-01 07:07:56,213 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 35
[2021-05-01 07:07:56,213 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-05-01 07:07:56,213 INFO  L480      AbstractCegarLoop]: Abstraction has 33 states and 36 transitions.
[2021-05-01 07:07:56,213 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2021-05-01 07:07:56,213 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions.
[2021-05-01 07:07:56,214 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2021-05-01 07:07:56,214 INFO  L511         BasicCegarLoop]: Found error trace
[2021-05-01 07:07:56,214 INFO  L519         BasicCegarLoop]: trace histogram [3, 3, 3, 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]
[2021-05-01 07:07:56,215 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-05-01 07:07:56,215 INFO  L428      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-05-01 07:07:56,215 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-05-01 07:07:56,215 INFO  L82        PathProgramCache]: Analyzing trace with hash -1824318825, now seen corresponding path program 1 times
[2021-05-01 07:07:56,215 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2021-05-01 07:07:56,216 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1110919542]
[2021-05-01 07:07:56,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-05-01 07:07:56,217 INFO  L224   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2021-05-01 07:07:56,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:56,320 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,321 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:56,322 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,323 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-05-01 07:07:56,330 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,331 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26
[2021-05-01 07:07:56,345 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 82.4 percent of original size
[2021-05-01 07:07:56,346 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42
[2021-05-01 07:07:56,370 INFO  L142       QuantifierPusher]: treesize reduction 179, result has 29.2 percent of original size
[2021-05-01 07:07:56,371 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74
[2021-05-01 07:07:56,416 INFO  L142       QuantifierPusher]: treesize reduction 642, result has 21.2 percent of original size
[2021-05-01 07:07:56,417 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 173
[2021-05-01 07:07:56,476 INFO  L142       QuantifierPusher]: treesize reduction 82, result has 90.1 percent of original size
[2021-05-01 07:07:56,480 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 746
[2021-05-01 07:07:56,657 WARN  L205               SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73
[2021-05-01 07:07:56,672 INFO  L142       QuantifierPusher]: treesize reduction 82, result has 89.9 percent of original size
[2021-05-01 07:07:56,674 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 728
[2021-05-01 07:07:56,697 INFO  L142       QuantifierPusher]: treesize reduction 32, result has 67.3 percent of original size
[2021-05-01 07:07:56,698 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66
[2021-05-01 07:07:56,737 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,738 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:56,751 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,751 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:56,768 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,768 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:56,795 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-05-01 07:07:56,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:56,801 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,801 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:56,802 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-05-01 07:07:56,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:56,815 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,816 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-05-01 07:07:56,827 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,827 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:56,843 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-05-01 07:07:56,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:56,858 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,858 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-05-01 07:07:56,859 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,859 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:56,860 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-05-01 07:07:56,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:56,868 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,869 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:56,869 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2021-05-01 07:07:56,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:56,896 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,896 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-05-01 07:07:56,897 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:56,897 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-05-01 07:07:56,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2021-05-01 07:07:56,899 INFO  L179   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2021-05-01 07:07:56,899 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1110919542]
[2021-05-01 07:07:56,899 INFO  L200   FreeRefinementEngine]: IpTcStrategyModulePreferences [1110919542] provided 1 perfect and 0 imperfect interpolant sequences
[2021-05-01 07:07:56,899 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-05-01 07:07:56,899 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-05-01 07:07:56,899 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270642246]
[2021-05-01 07:07:56,900 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 14 states
[2021-05-01 07:07:56,900 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2021-05-01 07:07:56,900 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-05-01 07:07:56,901 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2021-05-01 07:07:56,901 INFO  L87              Difference]: Start difference. First operand 33 states and 36 transitions. Second operand  has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5)
[2021-05-01 07:07:57,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-05-01 07:07:57,478 INFO  L93              Difference]: Finished difference Result 42 states and 45 transitions.
[2021-05-01 07:07:57,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-05-01 07:07:57,481 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37
[2021-05-01 07:07:57,481 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-05-01 07:07:57,482 INFO  L225             Difference]: With dead ends: 42
[2021-05-01 07:07:57,482 INFO  L226             Difference]: Without dead ends: 40
[2021-05-01 07:07:57,482 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 731.1ms TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462
[2021-05-01 07:07:57,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2021-05-01 07:07:57,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39.
[2021-05-01 07:07:57,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2021-05-01 07:07:57,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions.
[2021-05-01 07:07:57,494 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 37
[2021-05-01 07:07:57,494 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-05-01 07:07:57,494 INFO  L480      AbstractCegarLoop]: Abstraction has 39 states and 42 transitions.
[2021-05-01 07:07:57,495 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5)
[2021-05-01 07:07:57,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions.
[2021-05-01 07:07:57,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2021-05-01 07:07:57,506 INFO  L511         BasicCegarLoop]: Found error trace
[2021-05-01 07:07:57,506 INFO  L519         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1]
[2021-05-01 07:07:57,506 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-05-01 07:07:57,506 INFO  L428      AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-05-01 07:07:57,507 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-05-01 07:07:57,507 INFO  L82        PathProgramCache]: Analyzing trace with hash 583974312, now seen corresponding path program 1 times
[2021-05-01 07:07:57,507 INFO  L162   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2021-05-01 07:07:57,507 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [237469992]
[2021-05-01 07:07:57,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-05-01 07:07:57,509 INFO  L224   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2021-05-01 07:07:57,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:57,550 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,551 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,552 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,552 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-05-01 07:07:57,554 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,555 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-05-01 07:07:57,557 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,557 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33
[2021-05-01 07:07:57,566 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,567 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30
[2021-05-01 07:07:57,579 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,580 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28
[2021-05-01 07:07:57,586 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,586 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30
[2021-05-01 07:07:57,597 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,597 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35
[2021-05-01 07:07:57,601 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,601 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,619 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-05-01 07:07:57,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:57,626 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,627 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,627 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-05-01 07:07:57,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:57,630 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,630 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,631 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-05-01 07:07:57,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:57,637 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,638 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,638 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-05-01 07:07:57,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:57,642 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,643 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,643 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2021-05-01 07:07:57,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:57,647 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,647 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,648 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2021-05-01 07:07:57,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-05-01 07:07:57,654 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-05-01 07:07:57,655 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-05-01 07:07:57,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2021-05-01 07:07:57,656 INFO  L179   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2021-05-01 07:07:57,656 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [237469992]
[2021-05-01 07:07:57,656 INFO  L200   FreeRefinementEngine]: IpTcStrategyModulePreferences [237469992] provided 1 perfect and 0 imperfect interpolant sequences
[2021-05-01 07:07:57,656 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-05-01 07:07:57,656 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-05-01 07:07:57,656 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340564576]
[2021-05-01 07:07:57,657 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-05-01 07:07:57,657 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2021-05-01 07:07:57,657 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-05-01 07:07:57,657 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-05-01 07:07:57,658 INFO  L87              Difference]: Start difference. First operand 39 states and 42 transitions. Second operand  has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2021-05-01 07:07:57,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-05-01 07:07:57,813 INFO  L93              Difference]: Finished difference Result 45 states and 50 transitions.
[2021-05-01 07:07:57,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-05-01 07:07:57,813 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44
[2021-05-01 07:07:57,814 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-05-01 07:07:57,815 INFO  L225             Difference]: With dead ends: 45
[2021-05-01 07:07:57,815 INFO  L226             Difference]: Without dead ends: 0
[2021-05-01 07:07:57,815 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 65.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2021-05-01 07:07:57,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-05-01 07:07:57,816 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-05-01 07:07:57,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-05-01 07:07:57,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-05-01 07:07:57,816 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44
[2021-05-01 07:07:57,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-05-01 07:07:57,816 INFO  L480      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-05-01 07:07:57,817 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2021-05-01 07:07:57,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-05-01 07:07:57,817 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-05-01 07:07:57,817 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-05-01 07:07:57,819 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2021-05-01 07:07:58,138 WARN  L205               SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58
[2021-05-01 07:07:58,527 INFO  L198         CegarLoopUtils]: For program point  L18-1(line 18)  no Hoare annotation was computed.
[2021-05-01 07:07:58,527 INFO  L198         CegarLoopUtils]: For program point  reach_errorEXIT(line 18)  no Hoare annotation was computed.
[2021-05-01 07:07:58,527 INFO  L198         CegarLoopUtils]: For program point  reach_errorENTRY(line 18)  no Hoare annotation was computed.
[2021-05-01 07:07:58,527 INFO  L201         CegarLoopUtils]: At program point  ULTIMATE.initFINAL(line -1)  the Hoare annotation is:  true
[2021-05-01 07:07:58,527 INFO  L194         CegarLoopUtils]: At program point  ULTIMATE.initENTRY(line -1)  the Hoare annotation is:  (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|))
[2021-05-01 07:07:58,527 INFO  L201         CegarLoopUtils]: At program point  ULTIMATE.initEXIT(line -1)  the Hoare annotation is:  true
[2021-05-01 07:07:58,528 INFO  L201         CegarLoopUtils]: At program point  ULTIMATE.startEXIT(line -1)  the Hoare annotation is:  true
[2021-05-01 07:07:58,528 INFO  L201         CegarLoopUtils]: At program point  L-1(line -1)  the Hoare annotation is:  true
[2021-05-01 07:07:58,528 INFO  L201         CegarLoopUtils]: At program point  ULTIMATE.startENTRY(line -1)  the Hoare annotation is:  true
[2021-05-01 07:07:58,528 INFO  L201         CegarLoopUtils]: At program point  ULTIMATE.startFINAL(line -1)  the Hoare annotation is:  true
[2021-05-01 07:07:58,528 INFO  L201         CegarLoopUtils]: At program point  assume_abort_if_notENTRY(lines 20 22)  the Hoare annotation is:  true
[2021-05-01 07:07:58,528 INFO  L194         CegarLoopUtils]: At program point  L21(line 21)  the Hoare annotation is:  (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)
[2021-05-01 07:07:58,528 INFO  L194         CegarLoopUtils]: At program point  L21-2(lines 20 22)  the Hoare annotation is:  (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0)))
[2021-05-01 07:07:58,528 INFO  L194         CegarLoopUtils]: At program point  assume_abort_if_notEXIT(lines 20 22)  the Hoare annotation is:  (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0)))
[2021-05-01 07:07:58,528 INFO  L201         CegarLoopUtils]: At program point  mainEXIT(lines 33 61)  the Hoare annotation is:  true
[2021-05-01 07:07:58,529 INFO  L194         CegarLoopUtils]: At program point  L54-2(lines 54 58)  the Hoare annotation is:  (let ((.cse5 (div main_~index1~0 4294967296))) (let ((.cse4 (div main_~index2~0 4294967296)) (.cse0 (* 4294967296 .cse5))) (or (and (<= (+ .cse0 1) main_~index1~0) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse2 (select .cse3 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ .cse2 (* .cse1 (- 1)) 4294967295) 4294967296)))) .cse2))) (<= main_~index1~0 (+ .cse0 99999)) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294))) (<= (+ (* 4294967296 .cse4) main_~index1~0 1) (+ .cse0 main_~index2~0)))))
[2021-05-01 07:07:58,529 INFO  L194         CegarLoopUtils]: At program point  L46(line 46)  the Hoare annotation is:  (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (or (<= main_~index2~0 (+ .cse0 99998)) (and (<= main_~index2~0 (+ .cse0 99999)) (= main_~loop_entered~0 0))) (<= (+ .cse0 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0))))
[2021-05-01 07:07:58,529 INFO  L194         CegarLoopUtils]: At program point  L46-1(line 46)  the Hoare annotation is:  (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse0 99999)) (<= (+ .cse0 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0))))
[2021-05-01 07:07:58,529 INFO  L201         CegarLoopUtils]: At program point  mainFINAL(lines 33 61)  the Hoare annotation is:  true
[2021-05-01 07:07:58,529 INFO  L194         CegarLoopUtils]: At program point  mainENTRY(lines 33 61)  the Hoare annotation is:  (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))
[2021-05-01 07:07:58,529 INFO  L194         CegarLoopUtils]: At program point  L55(line 55)  the Hoare annotation is:  (let ((.cse5 (div main_~index1~0 4294967296)) (.cse4 (div main_~index2~0 4294967296))) (let ((.cse6 (* 4294967296 .cse4)) (.cse0 (* 4294967296 .cse5)) (.cse8 (* 4294967296 (div |main_#t~mem10| 4294967296))) (.cse7 (+ (* 4294967296 (div |main_#t~mem9| 4294967296)) |main_#t~mem10|))) (and (<= (+ .cse0 1) main_~index1~0) (or (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse2 (select .cse3 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ .cse2 (* .cse1 (- 1)) 4294967295) 4294967296)))) .cse2))) (<= (+ .cse6 main_~index1~0) (+ .cse0 main_~index2~0))) (<= main_~index1~0 (+ .cse0 99999)) (< .cse7 (+ |main_#t~mem9| .cse8 1)) (<= main_~index2~0 (+ .cse6 99999)) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294)) (<= (+ |main_#t~mem9| .cse8) .cse7))))
[2021-05-01 07:07:58,530 INFO  L194         CegarLoopUtils]: At program point  L55-1(line 55)  the Hoare annotation is:  (let ((.cse0 (* 4294967296 (div main_~index1~0 4294967296)))) (and (<= (+ .cse0 1) main_~index1~0) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294))))
[2021-05-01 07:07:58,530 INFO  L201         CegarLoopUtils]: At program point  L53(lines 53 59)  the Hoare annotation is:  true
[2021-05-01 07:07:58,530 INFO  L194         CegarLoopUtils]: At program point  L47(line 47)  the Hoare annotation is:  (let ((.cse2 (div main_~index2~0 4294967296))) (let ((.cse0 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (* 4294967296 .cse2)) (.cse1 (div main_~index1~0 4294967296))) (and (= (select .cse0 (+ (* .cse1 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)) |main_#t~mem5|) (= (select .cse0 (+ (* .cse2 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)) |main_#t~mem6|) (<= main_~index2~0 (+ .cse3 99999)) (<= (+ .cse3 main_~index1~0 1) (+ (* 4294967296 .cse1) main_~index2~0)))))
[2021-05-01 07:07:58,530 INFO  L194         CegarLoopUtils]: At program point  L47-1(line 47)  the Hoare annotation is:  (let ((.cse4 (div main_~index2~0 4294967296)) (.cse5 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (div main_~index1~0 4294967296))) (let ((.cse0 (select .cse5 (+ (* .cse3 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|))) (.cse1 (select .cse5 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|))) (.cse2 (* 4294967296 .cse4))) (and (= .cse0 |main_#t~mem5|) (= .cse1 |main_#t~mem6|) (<= main_~index2~0 (+ .cse2 99999)) (<= .cse1 (+ .cse0 (* 4294967296 (div (+ (* .cse0 (- 1)) .cse1) 4294967296)))) (<= (+ .cse2 main_~index1~0 1) (+ (* 4294967296 .cse3) main_~index2~0)))))
[2021-05-01 07:07:58,530 INFO  L194         CegarLoopUtils]: At program point  L45-1(lines 43 51)  the Hoare annotation is:  (let ((.cse6 (div main_~index1~0 4294967296)) (.cse5 (div main_~index2~0 4294967296))) (let ((.cse1 (* 4294967296 .cse5)) (.cse0 (* 4294967296 .cse6))) (or (and (<= main_~index1~0 (+ .cse0 99999)) (<= main_~index2~0 (+ .cse1 99999)) (= main_~loop_entered~0 0)) (and (<= main_~index2~0 (+ .cse1 99998)) (<= (+ .cse0 1) main_~index1~0) (or (let ((.cse4 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse3 (select .cse4 (+ (* .cse6 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse2 (select .cse4 (+ (* .cse5 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse2 (* 4294967296 (div (+ .cse3 (* .cse2 (- 1)) 4294967295) 4294967296)))) .cse3))) (<= (+ .cse1 main_~index1~0) (+ .cse0 main_~index2~0))) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294))))))
[2021-05-01 07:07:58,531 INFO  L194         CegarLoopUtils]: At program point  L43(line 43)  the Hoare annotation is:  (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (= main_~loop_entered~0 0))
[2021-05-01 07:07:58,531 INFO  L194         CegarLoopUtils]: At program point  L45-2(lines 34 61)  the Hoare annotation is:  (or (let ((.cse6 (div main_~index1~0 4294967296)) (.cse5 (div main_~index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse5)) (.cse1 (* 4294967296 .cse6))) (and (<= main_~index2~0 (+ .cse0 99998)) (<= (+ .cse1 1) main_~index1~0) (or (let ((.cse4 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse3 (select .cse4 (+ (* .cse6 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse2 (select .cse4 (+ (* .cse5 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse2 (* 4294967296 (div (+ .cse3 (* .cse2 (- 1)) 4294967295) 4294967296)))) .cse3))) (<= (+ .cse0 main_~index1~0) (+ .cse1 main_~index2~0))) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse1 4294967294))))) (= main_~loop_entered~0 0))
[2021-05-01 07:07:58,531 INFO  L194         CegarLoopUtils]: At program point  L41(line 41)  the Hoare annotation is:  (= main_~loop_entered~0 0)
[2021-05-01 07:07:58,531 INFO  L194         CegarLoopUtils]: At program point  L41-1(line 41)  the Hoare annotation is:  (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (= main_~loop_entered~0 0))
[2021-05-01 07:07:58,531 INFO  L201         CegarLoopUtils]: At program point  __VERIFIER_assertENTRY(lines 23 29)  the Hoare annotation is:  true
[2021-05-01 07:07:58,531 INFO  L194         CegarLoopUtils]: At program point  L26(line 26)  the Hoare annotation is:  (= |__VERIFIER_assert_#in~cond| 0)
[2021-05-01 07:07:58,531 INFO  L194         CegarLoopUtils]: At program point  __VERIFIER_assertEXIT(lines 23 29)  the Hoare annotation is:  (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))
[2021-05-01 07:07:58,531 INFO  L194         CegarLoopUtils]: At program point  L25(lines 25 27)  the Hoare annotation is:  (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))
[2021-05-01 07:07:58,532 INFO  L194         CegarLoopUtils]: At program point  L25-2(lines 23 29)  the Hoare annotation is:  (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))
[2021-05-01 07:07:58,532 INFO  L194         CegarLoopUtils]: At program point  __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26)  the Hoare annotation is:  (= |__VERIFIER_assert_#in~cond| 0)
[2021-05-01 07:07:58,550 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.05 07:07:58 BoogieIcfgContainer
[2021-05-01 07:07:58,550 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-05-01 07:07:58,551 INFO  L168              Benchmark]: Toolchain (without parser) took 5391.36 ms. Allocated memory was 199.2 MB in the beginning and 239.1 MB in the end (delta: 39.8 MB). Free memory was 164.4 MB in the beginning and 112.4 MB in the end (delta: 52.0 MB). Peak memory consumption was 92.2 MB. Max. memory is 8.0 GB.
[2021-05-01 07:07:58,551 INFO  L168              Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 199.2 MB. Free memory is still 181.0 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2021-05-01 07:07:58,552 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 252.60 ms. Allocated memory is still 199.2 MB. Free memory was 164.2 MB in the beginning and 182.4 MB in the end (delta: -18.2 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB.
[2021-05-01 07:07:58,552 INFO  L168              Benchmark]: Boogie Preprocessor took 27.72 ms. Allocated memory is still 199.2 MB. Free memory was 181.8 MB in the beginning and 180.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
[2021-05-01 07:07:58,552 INFO  L168              Benchmark]: RCFGBuilder took 452.56 ms. Allocated memory is still 199.2 MB. Free memory was 180.3 MB in the beginning and 164.0 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB.
[2021-05-01 07:07:58,553 INFO  L168              Benchmark]: TraceAbstraction took 4650.70 ms. Allocated memory was 199.2 MB in the beginning and 239.1 MB in the end (delta: 39.8 MB). Free memory was 163.5 MB in the beginning and 112.4 MB in the end (delta: 51.1 MB). Peak memory consumption was 92.0 MB. Max. memory is 8.0 GB.
[2021-05-01 07:07:58,554 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.14 ms. Allocated memory is still 199.2 MB. Free memory is still 181.0 MB. There was no memory consumed. Max. memory is 8.0 GB.
 * CACSL2BoogieTranslator took 252.60 ms. Allocated memory is still 199.2 MB. Free memory was 164.2 MB in the beginning and 182.4 MB in the end (delta: -18.2 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB.
 * Boogie Preprocessor took 27.72 ms. Allocated memory is still 199.2 MB. Free memory was 181.8 MB in the beginning and 180.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
 * RCFGBuilder took 452.56 ms. Allocated memory is still 199.2 MB. Free memory was 180.3 MB in the beginning and 164.0 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB.
 * TraceAbstraction took 4650.70 ms. Allocated memory was 199.2 MB in the beginning and 239.1 MB in the end (delta: 39.8 MB). Free memory was 163.5 MB in the beginning and 112.4 MB in the end (delta: 51.1 MB). Peak memory consumption was 92.0 MB. Max. memory is 8.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 26]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3862.5ms, OverallIterations: 6, TraceHistogramMax: 3, EmptinessCheckTime: 26.8ms, AutomataDifference: 1859.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 708.9ms, InitialAbstractionConstructionTime: 9.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 152 SDtfs, 119 SDslu, 269 SDs, 0 SdLazy, 630 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 790.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1388.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 79.8ms AutomataMinimizationTime, 6 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 89 PreInvPairs, 126 NumberOfFragments, 950 HoareAnnotationTreeSize, 89 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 113.6ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 1060 FormulaSimplificationTreeSizeReductionInter, 579.5ms HoareSimplificationTimeInter, 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
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 43]: Loop Invariant
    Derived loop invariant: ((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && loop_entered == 0) || (((index2 <= 4294967296 * (index2 / 4294967296) + 99998 && 4294967296 * (index1 / 4294967296) + 1 <= index1) && (unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] + 4294967296 * ((unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] + unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] || 4294967296 * (index2 / 4294967296) + index1 <= 4294967296 * (index1 / 4294967296) + index2)) && 4294967296 * ((index2 * -1 + index1 + 4294967294) / 4294967296) + index2 <= 4294967296 * (index1 / 4294967296) + 4294967294)
  - InvariantResult [Line: 54]: Loop Invariant
    Derived loop invariant: (((4294967296 * (index1 / 4294967296) + 1 <= index1 && unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] + 4294967296 * ((unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] + unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array]) && index1 <= 4294967296 * (index1 / 4294967296) + 99999) && 4294967296 * ((index2 * -1 + index1 + 4294967294) / 4294967296) + index2 <= 4294967296 * (index1 / 4294967296) + 4294967294) || 4294967296 * (index2 / 4294967296) + index1 + 1 <= 4294967296 * (index1 / 4294967296) + index2
  - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not
    Derived contract for procedure assume_abort_if_not: cond == \old(cond) && !(\old(cond) == 0)
  - ProcedureContractResult [Line: 33]: Procedure Contract for main
    Derived contract for procedure main: 1
  - ProcedureContractResult [Line: 23]: Procedure Contract for __VERIFIER_assert
    Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0)
RESULT: Ultimate proved your program to be correct!
Received shutdown request...