java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:23:04,643 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:23:04,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:23:04,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:23:04,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:23:04,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:23:04,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:23:04,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:23:04,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:23:04,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:23:04,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:23:04,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:23:04,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:23:04,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:23:04,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:23:04,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:23:04,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:23:04,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:23:04,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:23:04,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:23:04,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:23:04,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:23:04,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:23:04,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:23:04,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:23:04,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:23:04,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:23:04,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:23:04,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:23:04,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:23:04,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:23:04,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:23:04,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:23:04,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:23:04,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:23:04,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:23:04,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:23:04,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:23:04,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:23:04,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:23:04,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:23:04,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-10-13 21:23:04,708 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 21:23:04,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:23:04,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:23:04,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 21:23:04,710 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 21:23:04,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:23:04,711 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 21:23:04,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 21:23:04,711 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 21:23:04,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 21:23:04,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:23:04,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:23:04,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:23:04,712 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 21:23:04,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 21:23:04,712 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 21:23:04,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:23:04,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:23:04,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 21:23:04,713 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 21:23:04,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 21:23:04,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:23:04,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:23:04,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:23:04,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:23:04,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 21:23:04,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:23:04,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:23:04,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES
[2019-10-13 21:23:05,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:23:05,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:23:05,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:23:05,057 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 21:23:05,058 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 21:23:05,058 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c
[2019-10-13 21:23:05,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dcce316/adb058e04e8845f68d73b98842aa5af7/FLAG72769024e
[2019-10-13 21:23:05,600 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 21:23:05,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c
[2019-10-13 21:23:05,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dcce316/adb058e04e8845f68d73b98842aa5af7/FLAG72769024e
[2019-10-13 21:23:05,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dcce316/adb058e04e8845f68d73b98842aa5af7
[2019-10-13 21:23:05,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:23:05,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:23:06,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:23:06,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:23:06,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:23:06,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:05" (1/1) ...
[2019-10-13 21:23:06,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7745b351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06, skipping insertion in model container
[2019-10-13 21:23:06,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:05" (1/1) ...
[2019-10-13 21:23:06,018 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 21:23:06,074 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:23:06,452 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:23:06,461 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 21:23:06,643 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:23:06,664 INFO L192 MainTranslator]: Completed translation
[2019-10-13 21:23:06,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06 WrapperNode
[2019-10-13 21:23:06,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:23:06,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:23:06,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:23:06,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:23:06,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (1/1) ...
[2019-10-13 21:23:06,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (1/1) ...
[2019-10-13 21:23:06,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (1/1) ...
[2019-10-13 21:23:06,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (1/1) ...
[2019-10-13 21:23:06,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (1/1) ...
[2019-10-13 21:23:06,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (1/1) ...
[2019-10-13 21:23:06,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (1/1) ...
[2019-10-13 21:23:06,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:23:06,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:23:06,796 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:23:06,796 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:23:06,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (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
[2019-10-13 21:23:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:23:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:23:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:23:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:23:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:23:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:23:08,002 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:23:08,003 INFO L284 CfgBuilder]: Removed 2 assume(true) statements.
[2019-10-13 21:23:08,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:08 BoogieIcfgContainer
[2019-10-13 21:23:08,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:23:08,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:23:08,006 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:23:08,009 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:23:08,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:05" (1/3) ...
[2019-10-13 21:23:08,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b702125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:08, skipping insertion in model container
[2019-10-13 21:23:08,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:06" (2/3) ...
[2019-10-13 21:23:08,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b702125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:08, skipping insertion in model container
[2019-10-13 21:23:08,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:08" (3/3) ...
[2019-10-13 21:23:08,013 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c
[2019-10-13 21:23:08,024 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:23:08,033 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:23:08,044 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:23:08,071 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:23:08,071 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 21:23:08,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:23:08,072 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:23:08,072 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:23:08,072 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 21:23:08,072 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:23:08,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:23:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states.
[2019-10-13 21:23:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-10-13 21:23:08,102 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:08,103 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:08,105 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:08,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:08,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times
[2019-10-13 21:23:08,118 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:08,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394598311]
[2019-10-13 21:23:08,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:08,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:08,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:08,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394598311]
[2019-10-13 21:23:08,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:08,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-10-13 21:23:08,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438022743]
[2019-10-13 21:23:08,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-10-13 21:23:08,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-10-13 21:23:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:23:08,285 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states.
[2019-10-13 21:23:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:08,320 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions.
[2019-10-13 21:23:08,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2019-10-13 21:23:08,322 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13
[2019-10-13 21:23:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:08,335 INFO L225 Difference]: With dead ends: 222
[2019-10-13 21:23:08,335 INFO L226 Difference]: Without dead ends: 104
[2019-10-13 21:23:08,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:23:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2019-10-13 21:23:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2019-10-13 21:23:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states.
[2019-10-13 21:23:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions.
[2019-10-13 21:23:08,400 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13
[2019-10-13 21:23:08,401 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:08,401 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions.
[2019-10-13 21:23:08,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-10-13 21:23:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions.
[2019-10-13 21:23:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-10-13 21:23:08,402 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:08,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:08,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times
[2019-10-13 21:23:08,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:08,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617793294]
[2019-10-13 21:23:08,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:08,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:08,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:08,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617793294]
[2019-10-13 21:23:08,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:08,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:08,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706423143]
[2019-10-13 21:23:08,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:08,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:08,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:08,517 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states.
[2019-10-13 21:23:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:08,623 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions.
[2019-10-13 21:23:08,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:08,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2019-10-13 21:23:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:08,626 INFO L225 Difference]: With dead ends: 205
[2019-10-13 21:23:08,628 INFO L226 Difference]: Without dead ends: 107
[2019-10-13 21:23:08,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2019-10-13 21:23:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2019-10-13 21:23:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2019-10-13 21:23:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions.
[2019-10-13 21:23:08,652 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14
[2019-10-13 21:23:08,653 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:08,653 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions.
[2019-10-13 21:23:08,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions.
[2019-10-13 21:23:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-10-13 21:23:08,656 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:08,656 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:08,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times
[2019-10-13 21:23:08,657 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:08,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263718158]
[2019-10-13 21:23:08,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:08,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:08,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:09,075 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 16
[2019-10-13 21:23:11,389 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 113 DAG size of output: 41
[2019-10-13 21:23:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:11,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263718158]
[2019-10-13 21:23:11,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:11,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:23:11,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477431081]
[2019-10-13 21:23:11,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:23:11,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:11,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:23:11,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:23:11,403 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states.
[2019-10-13 21:23:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:11,858 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions.
[2019-10-13 21:23:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:11,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2019-10-13 21:23:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:11,861 INFO L225 Difference]: With dead ends: 209
[2019-10-13 21:23:11,862 INFO L226 Difference]: Without dead ends: 190
[2019-10-13 21:23:11,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:23:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2019-10-13 21:23:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176.
[2019-10-13 21:23:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states.
[2019-10-13 21:23:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions.
[2019-10-13 21:23:11,876 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19
[2019-10-13 21:23:11,876 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:11,876 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions.
[2019-10-13 21:23:11,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:23:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions.
[2019-10-13 21:23:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-10-13 21:23:11,878 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:11,878 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:11,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times
[2019-10-13 21:23:11,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:11,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688352947]
[2019-10-13 21:23:11,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:11,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:11,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:11,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688352947]
[2019-10-13 21:23:11,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:11,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:11,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657248186]
[2019-10-13 21:23:11,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:11,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:11,945 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states.
[2019-10-13 21:23:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:11,986 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions.
[2019-10-13 21:23:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:11,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2019-10-13 21:23:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:11,988 INFO L225 Difference]: With dead ends: 297
[2019-10-13 21:23:11,988 INFO L226 Difference]: Without dead ends: 128
[2019-10-13 21:23:11,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2019-10-13 21:23:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126.
[2019-10-13 21:23:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2019-10-13 21:23:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions.
[2019-10-13 21:23:12,015 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20
[2019-10-13 21:23:12,015 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:12,016 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions.
[2019-10-13 21:23:12,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions.
[2019-10-13 21:23:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-10-13 21:23:12,017 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:12,018 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:12,019 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times
[2019-10-13 21:23:12,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:12,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533209876]
[2019-10-13 21:23:12,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:12,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:12,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2019-10-13 21:23:12,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533209876]
[2019-10-13 21:23:12,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:12,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:12,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687944725]
[2019-10-13 21:23:12,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:12,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:12,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:12,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:12,111 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states.
[2019-10-13 21:23:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:12,148 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions.
[2019-10-13 21:23:12,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:12,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25
[2019-10-13 21:23:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:12,151 INFO L225 Difference]: With dead ends: 230
[2019-10-13 21:23:12,151 INFO L226 Difference]: Without dead ends: 111
[2019-10-13 21:23:12,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2019-10-13 21:23:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109.
[2019-10-13 21:23:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2019-10-13 21:23:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions.
[2019-10-13 21:23:12,164 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25
[2019-10-13 21:23:12,164 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:12,164 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions.
[2019-10-13 21:23:12,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions.
[2019-10-13 21:23:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2019-10-13 21:23:12,166 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:12,166 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:12,166 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:12,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times
[2019-10-13 21:23:12,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:12,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931622638]
[2019-10-13 21:23:12,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:12,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:12,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:14,320 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~P1~0 2)) (.cse21 (div c_main_~this_expect~0 2))) (let ((.cse12 (* 2 .cse21)) (.cse18 (* .cse20 (- 2))) (.cse19 (* .cse21 (- 2)))) (let ((.cse11 (* 2 c_main_~P1~0)) (.cse14 (* 4294967296 (div (+ c_main_~this_expect~0 .cse19) 4294967296))) (.cse17 (= c_main_~P1~0 (* 2 .cse20))) (.cse2 (* 4 .cse20)) (.cse1 (* 4294967296 (div (+ c_main_~P1~0 .cse18) 4294967296))) (.cse15 (= .cse12 c_main_~this_expect~0)) (.cse16 (* 4294967296 (div c_main_~this_expect~0 4294967296)))) (let ((.cse8 (< c_main_~this_expect~0 .cse16)) (.cse9 (not .cse15)) (.cse10 (* 4294967296 (div (+ c_main_~this_expect~0 .cse19 (- 2)) 4294967296))) (.cse13 (+ c_main_~this_expect~0 .cse2 .cse1)) (.cse0 (or .cse17 (<= 0 c_main_~P1~0))) (.cse3 (+ .cse11 .cse14 .cse12)) (.cse5 (* 4294967296 (div (+ c_main_~P1~0 .cse18 (- 2)) 4294967296))) (.cse4 (< c_main_~P1~0 0)) (.cse6 (not .cse17)) (.cse7 (or .cse15 (<= .cse16 c_main_~this_expect~0)))) (or (and (or (and .cse0 (<= (+ c_main_~this_expect~0 .cse1 .cse2 1) .cse3)) (and .cse4 (<= (+ c_main_~this_expect~0 .cse2 .cse5 5) .cse3) .cse6)) .cse7) (and .cse8 .cse9 (or (and .cse0 (<= (+ c_main_~this_expect~0 .cse1 .cse2) (+ .cse10 .cse11 .cse12 3))) (and .cse4 (<= (+ c_main_~this_expect~0 .cse2 .cse5 1) (+ .cse10 .cse11 .cse12)) .cse6))) (and .cse8 .cse9 (or (and .cse4 (<= (+ .cse10 .cse11 .cse12 1) (+ c_main_~this_expect~0 .cse2 .cse5)) .cse6) (and .cse0 (<= (+ .cse10 .cse11 .cse12 5) .cse13)))) (and (or (and (<= (+ .cse11 .cse14 .cse12 1) .cse13) .cse0) (and (<= .cse3 (+ c_main_~this_expect~0 .cse2 .cse5 3)) .cse4 .cse6)) .cse7)))))) is different from false
[2019-10-13 21:23:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2019-10-13 21:23:14,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931622638]
[2019-10-13 21:23:14,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904706674]
[2019-10-13 21:23:14,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:14,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-10-13 21:23:14,447 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:23:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:14,506 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:23:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:14,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1418283989]
[2019-10-13 21:23:14,567 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 28
[2019-10-13 21:23:14,625 INFO L148 AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 21:23:14,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 21:23:14,799 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-13 21:23:15,817 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2019-10-13 21:23:15,819 INFO L272 AbstractInterpreter]: Visited 24 different actions 48 times. Merged at 15 different actions 19 times. Never widened. Performed 264 root evaluator evaluations with a maximum evaluation depth of 16. Performed 264 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 4 fixpoints after 3 different actions. Largest state had 39 variables.
[2019-10-13 21:23:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:15,826 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown
[2019-10-13 21:23:15,830 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:23:15,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9
[2019-10-13 21:23:15,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538792815]
[2019-10-13 21:23:15,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-10-13 21:23:15,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:15,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-10-13 21:23:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72
[2019-10-13 21:23:15,835 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 9 states.
[2019-10-13 21:23:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:16,500 INFO L93 Difference]: Finished difference Result 354 states and 561 transitions.
[2019-10-13 21:23:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2019-10-13 21:23:16,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27
[2019-10-13 21:23:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:16,506 INFO L225 Difference]: With dead ends: 354
[2019-10-13 21:23:16,506 INFO L226 Difference]: Without dead ends: 314
[2019-10-13 21:23:16,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156
[2019-10-13 21:23:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states.
[2019-10-13 21:23:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279.
[2019-10-13 21:23:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states.
[2019-10-13 21:23:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 438 transitions.
[2019-10-13 21:23:16,535 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 438 transitions. Word has length 27
[2019-10-13 21:23:16,535 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:16,535 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 438 transitions.
[2019-10-13 21:23:16,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-10-13 21:23:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 438 transitions.
[2019-10-13 21:23:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2019-10-13 21:23:16,536 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:16,537 INFO L380 BasicCegarLoop]: trace histogram [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]
[2019-10-13 21:23:16,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:16,744 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times
[2019-10-13 21:23:16,744 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:16,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092753060]
[2019-10-13 21:23:16,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:16,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:16,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2019-10-13 21:23:16,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092753060]
[2019-10-13 21:23:16,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:16,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:16,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213606834]
[2019-10-13 21:23:16,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:16,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:16,782 INFO L87 Difference]: Start difference. First operand 279 states and 438 transitions. Second operand 3 states.
[2019-10-13 21:23:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:16,822 INFO L93 Difference]: Finished difference Result 552 states and 865 transitions.
[2019-10-13 21:23:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:16,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29
[2019-10-13 21:23:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:16,825 INFO L225 Difference]: With dead ends: 552
[2019-10-13 21:23:16,825 INFO L226 Difference]: Without dead ends: 301
[2019-10-13 21:23:16,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states.
[2019-10-13 21:23:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299.
[2019-10-13 21:23:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states.
[2019-10-13 21:23:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions.
[2019-10-13 21:23:16,842 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 29
[2019-10-13 21:23:16,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:16,844 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions.
[2019-10-13 21:23:16,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions.
[2019-10-13 21:23:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2019-10-13 21:23:16,848 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:16,849 INFO L380 BasicCegarLoop]: trace histogram [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]
[2019-10-13 21:23:16,849 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:16,850 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times
[2019-10-13 21:23:16,850 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:16,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690738531]
[2019-10-13 21:23:16,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:16,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:16,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:17,244 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27
[2019-10-13 21:23:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:17,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690738531]
[2019-10-13 21:23:17,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150713452]
[2019-10-13 21:23:17,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:17,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-10-13 21:23:17,350 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:23:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2019-10-13 21:23:17,374 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:23:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 21:23:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2019-10-13 21:23:17,509 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences.
[2019-10-13 21:23:17,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7
[2019-10-13 21:23:17,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217273583]
[2019-10-13 21:23:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:23:17,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:23:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-10-13 21:23:17,514 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand 4 states.
[2019-10-13 21:23:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:17,536 INFO L93 Difference]: Finished difference Result 302 states and 460 transitions.
[2019-10-13 21:23:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:17,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31
[2019-10-13 21:23:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:17,540 INFO L225 Difference]: With dead ends: 302
[2019-10-13 21:23:17,540 INFO L226 Difference]: Without dead ends: 296
[2019-10-13 21:23:17,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-10-13 21:23:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states.
[2019-10-13 21:23:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295.
[2019-10-13 21:23:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states.
[2019-10-13 21:23:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 446 transitions.
[2019-10-13 21:23:17,552 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 446 transitions. Word has length 31
[2019-10-13 21:23:17,552 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:17,552 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 446 transitions.
[2019-10-13 21:23:17,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:23:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 446 transitions.
[2019-10-13 21:23:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2019-10-13 21:23:17,556 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:17,557 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:17,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:17,763 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1646630523, now seen corresponding path program 1 times
[2019-10-13 21:23:17,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:17,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140191706]
[2019-10-13 21:23:17,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:17,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:17,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2019-10-13 21:23:17,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140191706]
[2019-10-13 21:23:17,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:17,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:17,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084236025]
[2019-10-13 21:23:17,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:17,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:17,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:17,815 INFO L87 Difference]: Start difference. First operand 295 states and 446 transitions. Second operand 3 states.
[2019-10-13 21:23:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:17,844 INFO L93 Difference]: Finished difference Result 514 states and 779 transitions.
[2019-10-13 21:23:17,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:17,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37
[2019-10-13 21:23:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:17,847 INFO L225 Difference]: With dead ends: 514
[2019-10-13 21:23:17,848 INFO L226 Difference]: Without dead ends: 247
[2019-10-13 21:23:17,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2019-10-13 21:23:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245.
[2019-10-13 21:23:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2019-10-13 21:23:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions.
[2019-10-13 21:23:17,856 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 37
[2019-10-13 21:23:17,857 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:17,857 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions.
[2019-10-13 21:23:17,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions.
[2019-10-13 21:23:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2019-10-13 21:23:17,858 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:17,858 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:17,858 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times
[2019-10-13 21:23:17,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:17,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939820196]
[2019-10-13 21:23:17,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:17,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:17,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2019-10-13 21:23:17,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939820196]
[2019-10-13 21:23:17,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:17,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:17,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741708698]
[2019-10-13 21:23:17,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:17,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:17,906 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states.
[2019-10-13 21:23:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:17,948 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions.
[2019-10-13 21:23:17,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:17,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41
[2019-10-13 21:23:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:17,952 INFO L225 Difference]: With dead ends: 428
[2019-10-13 21:23:17,952 INFO L226 Difference]: Without dead ends: 229
[2019-10-13 21:23:17,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states.
[2019-10-13 21:23:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227.
[2019-10-13 21:23:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states.
[2019-10-13 21:23:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions.
[2019-10-13 21:23:17,961 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41
[2019-10-13 21:23:17,961 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:17,961 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions.
[2019-10-13 21:23:17,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions.
[2019-10-13 21:23:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2019-10-13 21:23:17,963 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:17,963 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:17,963 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:17,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:17,963 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times
[2019-10-13 21:23:17,964 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:17,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269379392]
[2019-10-13 21:23:17,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:17,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:17,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2019-10-13 21:23:18,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269379392]
[2019-10-13 21:23:18,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:18,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:18,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355557191]
[2019-10-13 21:23:18,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:18,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:18,045 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states.
[2019-10-13 21:23:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:18,084 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions.
[2019-10-13 21:23:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:23:18,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50
[2019-10-13 21:23:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:18,086 INFO L225 Difference]: With dead ends: 309
[2019-10-13 21:23:18,086 INFO L226 Difference]: Without dead ends: 147
[2019-10-13 21:23:18,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2019-10-13 21:23:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145.
[2019-10-13 21:23:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states.
[2019-10-13 21:23:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions.
[2019-10-13 21:23:18,094 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50
[2019-10-13 21:23:18,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:18,095 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions.
[2019-10-13 21:23:18,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions.
[2019-10-13 21:23:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2019-10-13 21:23:18,096 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:23:18,096 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:18,096 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times
[2019-10-13 21:23:18,097 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:18,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515093510]
[2019-10-13 21:23:18,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:18,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:18,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2019-10-13 21:23:18,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515093510]
[2019-10-13 21:23:18,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63730421]
[2019-10-13 21:23:18,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:18,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjunts are in the unsatisfiable core
[2019-10-13 21:23:18,468 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:23:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:18,529 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:23:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:23:18,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1357439692]
[2019-10-13 21:23:18,652 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 52
[2019-10-13 21:23:18,656 INFO L148 AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 21:23:18,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 21:23:18,694 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-13 21:23:27,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2019-10-13 21:23:27,599 INFO L272 AbstractInterpreter]: Visited 39 different actions 341 times. Merged at 32 different actions 263 times. Widened at 4 different actions 11 times. Performed 1452 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1452 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 36 fixpoints after 9 different actions. Largest state had 46 variables.
[2019-10-13 21:23:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:27,599 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown
[2019-10-13 21:23:27,600 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:23:27,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14
[2019-10-13 21:23:27,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255250795]
[2019-10-13 21:23:27,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states
[2019-10-13 21:23:27,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2019-10-13 21:23:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182
[2019-10-13 21:23:27,602 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 14 states.
[2019-10-13 21:23:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:27,868 INFO L93 Difference]: Finished difference Result 167 states and 235 transitions.
[2019-10-13 21:23:27,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2019-10-13 21:23:27,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51
[2019-10-13 21:23:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:27,869 INFO L225 Difference]: With dead ends: 167
[2019-10-13 21:23:27,869 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 21:23:27,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342
[2019-10-13 21:23:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 21:23:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 21:23:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 21:23:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 21:23:27,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51
[2019-10-13 21:23:27,871 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:27,871 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 21:23:27,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2019-10-13 21:23:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 21:23:27,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 21:23:28,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:28,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 21:23:28,360 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42
[2019-10-13 21:23:28,363 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 21:23:28,364 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true
[2019-10-13 21:23:28,364 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:23:28,364 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:23:28,364 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 21:23:28,364 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 21:23:28,365 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 21:23:28,365 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed.
[2019-10-13 21:23:28,365 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed.
[2019-10-13 21:23:28,365 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed.
[2019-10-13 21:23:28,365 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed.
[2019-10-13 21:23:28,365 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed.
[2019-10-13 21:23:28,365 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed.
[2019-10-13 21:23:28,366 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed.
[2019-10-13 21:23:28,367 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed.
[2019-10-13 21:23:28,367 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed.
[2019-10-13 21:23:28,367 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed.
[2019-10-13 21:23:28,367 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed.
[2019-10-13 21:23:28,367 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed.
[2019-10-13 21:23:28,367 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed.
[2019-10-13 21:23:28,367 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed.
[2019-10-13 21:23:28,368 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed.
[2019-10-13 21:23:28,369 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed.
[2019-10-13 21:23:28,370 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed.
[2019-10-13 21:23:28,370 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed.
[2019-10-13 21:23:28,370 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed.
[2019-10-13 21:23:28,370 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed.
[2019-10-13 21:23:28,370 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed.
[2019-10-13 21:23:28,370 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed.
[2019-10-13 21:23:28,370 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed.
[2019-10-13 21:23:28,371 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed.
[2019-10-13 21:23:28,371 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed.
[2019-10-13 21:23:28,371 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed.
[2019-10-13 21:23:28,371 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed.
[2019-10-13 21:23:28,371 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed.
[2019-10-13 21:23:28,371 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed.
[2019-10-13 21:23:28,372 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed.
[2019-10-13 21:23:28,372 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed.
[2019-10-13 21:23:28,372 INFO L439 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false
[2019-10-13 21:23:28,372 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed.
[2019-10-13 21:23:28,372 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed.
[2019-10-13 21:23:28,372 INFO L443 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed.
[2019-10-13 21:23:28,373 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= main_~this_buffer_empty~0 0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) .cse0 (= main_~q~0 0)) (and (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) .cse0 (<= main_~P8~0 2147483647) (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 2)) 2)) 2)))))
[2019-10-13 21:23:28,373 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed.
[2019-10-13 21:23:28,373 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed.
[2019-10-13 21:23:28,373 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed.
[2019-10-13 21:23:28,373 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed.
[2019-10-13 21:23:28,373 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed.
[2019-10-13 21:23:28,373 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed.
[2019-10-13 21:23:28,373 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed.
[2019-10-13 21:23:28,374 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed.
[2019-10-13 21:23:28,374 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed.
[2019-10-13 21:23:28,374 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed.
[2019-10-13 21:23:28,374 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed.
[2019-10-13 21:23:28,374 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed.
[2019-10-13 21:23:28,374 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed.
[2019-10-13 21:23:28,374 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed.
[2019-10-13 21:23:28,375 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed.
[2019-10-13 21:23:28,375 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed.
[2019-10-13 21:23:28,375 INFO L439 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse2 (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 1)) 2)) 1))) (.cse0 (= main_~this_buffer_empty~0 1)) (.cse1 (<= 0 (+ main_~P8~0 2147483648))) (.cse4 (= main_~this_buffer_empty~0 0)) (.cse3 (<= main_~P8~0 2147483647)) (.cse5 (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 2)) 2)) 2)))) (or (and (= 4 main_~q~0) .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3 (= 3 main_~q~0)) (and .cse0 .cse1 .cse3 (= 1 main_~q~0) .cse5) (and (<= main_~this_expect~0 0) .cse4 (= main_~q~0 0) (<= 0 main_~this_expect~0)) (and (<= 5 main_~q~0) .cse1 .cse4 .cse3 .cse5)))
[2019-10-13 21:23:28,375 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed.
[2019-10-13 21:23:28,375 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed.
[2019-10-13 21:23:28,375 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed.
[2019-10-13 21:23:28,375 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed.
[2019-10-13 21:23:28,376 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed.
[2019-10-13 21:23:28,376 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed.
[2019-10-13 21:23:28,376 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed.
[2019-10-13 21:23:28,376 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed.
[2019-10-13 21:23:28,376 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed.
[2019-10-13 21:23:28,376 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed.
[2019-10-13 21:23:28,376 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed.
[2019-10-13 21:23:28,377 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed.
[2019-10-13 21:23:28,377 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed.
[2019-10-13 21:23:28,377 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true
[2019-10-13 21:23:28,377 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed.
[2019-10-13 21:23:28,377 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed.
[2019-10-13 21:23:28,377 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed.
[2019-10-13 21:23:28,377 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed.
[2019-10-13 21:23:28,377 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed.
[2019-10-13 21:23:28,378 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed.
[2019-10-13 21:23:28,378 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed.
[2019-10-13 21:23:28,378 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed.
[2019-10-13 21:23:28,378 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed.
[2019-10-13 21:23:28,378 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed.
[2019-10-13 21:23:28,378 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed.
[2019-10-13 21:23:28,378 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed.
[2019-10-13 21:23:28,379 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed.
[2019-10-13 21:23:28,379 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed.
[2019-10-13 21:23:28,379 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed.
[2019-10-13 21:23:28,379 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed.
[2019-10-13 21:23:28,379 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed.
[2019-10-13 21:23:28,379 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed.
[2019-10-13 21:23:28,379 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed.
[2019-10-13 21:23:28,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:23:28 BoogieIcfgContainer
[2019-10-13 21:23:28,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:23:28,405 INFO L168 Benchmark]: Toolchain (without parser) took 22405.41 ms. Allocated memory was 141.6 MB in the beginning and 1.0 GB in the end (delta: 866.6 MB). Free memory was 98.4 MB in the beginning and 335.8 MB in the end (delta: -237.4 MB). Peak memory consumption was 629.3 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:28,406 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:23:28,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.75 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 98.2 MB in the beginning and 171.0 MB in the end (delta: -72.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:28,410 INFO L168 Benchmark]: Boogie Preprocessor took 129.24 ms. Allocated memory is still 199.2 MB. Free memory was 171.0 MB in the beginning and 168.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:28,411 INFO L168 Benchmark]: RCFGBuilder took 1209.06 ms. Allocated memory is still 199.2 MB. Free memory was 168.1 MB in the beginning and 114.9 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:28,415 INFO L168 Benchmark]: TraceAbstraction took 20396.81 ms. Allocated memory was 199.2 MB in the beginning and 1.0 GB in the end (delta: 809.0 MB). Free memory was 114.1 MB in the beginning and 335.8 MB in the end (delta: -221.7 MB). Peak memory consumption was 587.3 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:28,423 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 664.75 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 98.2 MB in the beginning and 171.0 MB in the end (delta: -72.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 129.24 ms. Allocated memory is still 199.2 MB. Free memory was 171.0 MB in the beginning and 168.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 1209.06 ms. Allocated memory is still 199.2 MB. Free memory was 168.1 MB in the beginning and 114.9 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 20396.81 ms. Allocated memory was 199.2 MB in the beginning and 1.0 GB in the end (delta: 809.0 MB). Free memory was 114.1 MB in the beginning and 335.8 MB in the end (delta: -221.7 MB). Peak memory consumption was 587.3 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 24]: Loop Invariant
Derived loop invariant: (((this_expect <= 0 && 0 <= this_expect) && this_buffer_empty == 0) && q == 0) || ((((5 <= q && 0 <= P8 + 2147483648) && this_buffer_empty == 0) && P8 <= 2147483647) && this_expect <= 2 * ((this_expect + -2) / 2) + 2)
- InvariantResult [Line: 24]: Loop Invariant
Derived loop invariant: (((((((4 == q && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && P8 <= 2147483647) || ((((0 <= P8 + 2147483648 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && this_buffer_empty == 0) && P8 <= 2147483647) && 3 == q)) || ((((this_buffer_empty == 1 && 0 <= P8 + 2147483648) && P8 <= 2147483647) && 1 == q) && this_expect <= 2 * ((this_expect + -2) / 2) + 2)) || (((this_expect <= 0 && this_buffer_empty == 0) && q == 0) && 0 <= this_expect)) || ((((5 <= q && 0 <= P8 + 2147483648) && this_buffer_empty == 0) && P8 <= 2147483647) && this_expect <= 2 * ((this_expect + -2) / 2) + 2)
- InvariantResult [Line: 14]: Loop Invariant
Derived loop invariant: 0
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 114 locations, 1 error locations. Result: SAFE, OverallTime: 20.3s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 1851 SDtfs, 2126 SDslu, 2137 SDs, 0 SdLazy, 413 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 235 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 62 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 19 NumberOfFragments, 163 HoareAnnotationTreeSize, 7 FomulaSimplifications, 111 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 242 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 557 ConstructedInterpolants, 11 QuantifiedInterpolants, 239705 SizeOfPredicates, 11 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 153/235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...