java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-21 21:40:30,941 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-21 21:40:30,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-21 21:40:30,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-21 21:40:30,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-21 21:40:30,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-21 21:40:30,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-21 21:40:30,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-21 21:40:30,973 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-21 21:40:30,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-21 21:40:30,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-21 21:40:30,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-21 21:40:30,978 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-21 21:40:30,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-21 21:40:30,983 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-21 21:40:30,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-21 21:40:30,984 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-21 21:40:30,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-21 21:40:30,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-21 21:40:30,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-21 21:40:30,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-21 21:40:31,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-21 21:40:31,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-21 21:40:31,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-21 21:40:31,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-21 21:40:31,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-21 21:40:31,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-21 21:40:31,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-21 21:40:31,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-21 21:40:31,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-21 21:40:31,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-21 21:40:31,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-21 21:40:31,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-21 21:40:31,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-21 21:40:31,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-21 21:40:31,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-21 21:40:31,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-07-21 21:40:31,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-21 21:40:31,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-21 21:40:31,046 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-21 21:40:31,046 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-21 21:40:31,046 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-21 21:40:31,046 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-21 21:40:31,047 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-21 21:40:31,047 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-21 21:40:31,047 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-21 21:40:31,047 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-21 21:40:31,047 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-07-21 21:40:31,048 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-21 21:40:31,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-21 21:40:31,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-21 21:40:31,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-21 21:40:31,050 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-21 21:40:31,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-21 21:40:31,050 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-21 21:40:31,050 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-21 21:40:31,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-21 21:40:31,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-21 21:40:31,051 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-21 21:40:31,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-21 21:40:31,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-21 21:40:31,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-21 21:40:31,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-21 21:40:31,052 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-21 21:40:31,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-21 21:40:31,054 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-21 21:40:31,054 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-07-21 21:40:31,054 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-21 21:40:31,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-21 21:40:31,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-21 21:40:31,055 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-21 21:40:31,055 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-21 21:40:31,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-21 21:40:31,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-21 21:40:31,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-21 21:40:31,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-21 21:40:31,135 INFO L276 PluginConnector]: CDTParser initialized [2018-07-21 21:40:31,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c [2018-07-21 21:40:31,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/7d15a87d9/9bc897f6a1fb49509804d861c69fe16a/FLAG11cd717e4 [2018-07-21 21:40:31,801 INFO L276 CDTParser]: Found 1 translation units. [2018-07-21 21:40:31,802 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c [2018-07-21 21:40:31,823 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/7d15a87d9/9bc897f6a1fb49509804d861c69fe16a/FLAG11cd717e4 [2018-07-21 21:40:31,846 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/7d15a87d9/9bc897f6a1fb49509804d861c69fe16a [2018-07-21 21:40:31,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-21 21:40:31,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-21 21:40:31,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-21 21:40:31,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-21 21:40:31,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-21 21:40:31,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:40:31" (1/1) ... [2018-07-21 21:40:31,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edbe32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:31, skipping insertion in model container [2018-07-21 21:40:31,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:40:31" (1/1) ... [2018-07-21 21:40:32,092 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-21 21:40:32,155 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-21 21:40:32,173 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-21 21:40:32,209 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-21 21:40:32,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32 WrapperNode [2018-07-21 21:40:32,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-21 21:40:32,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-21 21:40:32,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-21 21:40:32,254 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-21 21:40:32,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-21 21:40:32,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-21 21:40:32,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-21 21:40:32,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-21 21:40:32,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... [2018-07-21 21:40:32,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-21 21:40:32,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-21 21:40:32,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-21 21:40:32,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-21 21:40:32,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (1/1) ... No working directory specified, using /storage/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 [2018-07-21 21:40:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-21 21:40:32,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-21 21:40:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-21 21:40:32,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-21 21:40:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-21 21:40:32,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-21 21:40:33,501 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-21 21:40:33,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:40:33 BoogieIcfgContainer [2018-07-21 21:40:33,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-21 21:40:33,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-21 21:40:33,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-21 21:40:33,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-21 21:40:33,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:40:31" (1/3) ... [2018-07-21 21:40:33,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a002236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:40:33, skipping insertion in model container [2018-07-21 21:40:33,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:40:32" (2/3) ... [2018-07-21 21:40:33,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a002236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:40:33, skipping insertion in model container [2018-07-21 21:40:33,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:40:33" (3/3) ... [2018-07-21 21:40:33,511 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_security_true-unreach-call_false-termination.c [2018-07-21 21:40:33,522 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-21 21:40:33,531 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-21 21:40:33,585 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-21 21:40:33,585 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-21 21:40:33,585 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-21 21:40:33,586 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-21 21:40:33,586 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-21 21:40:33,586 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-21 21:40:33,586 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-21 21:40:33,586 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-21 21:40:33,586 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-21 21:40:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-07-21 21:40:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-21 21:40:33,621 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:33,622 INFO L358 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:40:33,622 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1921368221, now seen corresponding path program 1 times [2018-07-21 21:40:33,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:33,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:33,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:33,678 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-21 21:40:33,769 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:33,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-21 21:40:33,769 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:33,772 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-21 21:40:33,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-21 21:40:33,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-21 21:40:33,791 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2018-07-21 21:40:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:33,828 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2018-07-21 21:40:33,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-21 21:40:33,831 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-07-21 21:40:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:33,846 INFO L225 Difference]: With dead ends: 160 [2018-07-21 21:40:33,846 INFO L226 Difference]: Without dead ends: 78 [2018-07-21 21:40:33,851 INFO L578 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 [2018-07-21 21:40:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-21 21:40:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-21 21:40:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-21 21:40:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2018-07-21 21:40:33,914 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2018-07-21 21:40:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:33,915 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2018-07-21 21:40:33,915 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-21 21:40:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2018-07-21 21:40:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-21 21:40:33,918 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:33,918 INFO L358 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:40:33,918 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:33,919 INFO L82 PathProgramCache]: Analyzing trace with hash -34635363, now seen corresponding path program 1 times [2018-07-21 21:40:33,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:33,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:33,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:33,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:33,921 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-21 21:40:34,018 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:34,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:34,018 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:34,022 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:34,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:34,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:34,023 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 3 states. [2018-07-21 21:40:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:34,300 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2018-07-21 21:40:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:34,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-07-21 21:40:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:34,303 INFO L225 Difference]: With dead ends: 153 [2018-07-21 21:40:34,303 INFO L226 Difference]: Without dead ends: 81 [2018-07-21 21:40:34,304 INFO L578 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 [2018-07-21 21:40:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-21 21:40:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-21 21:40:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-21 21:40:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2018-07-21 21:40:34,315 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2018-07-21 21:40:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:34,316 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2018-07-21 21:40:34,316 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2018-07-21 21:40:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-21 21:40:34,317 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:34,317 INFO L358 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:40:34,317 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:34,317 INFO L82 PathProgramCache]: Analyzing trace with hash -304388480, now seen corresponding path program 1 times [2018-07-21 21:40:34,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:34,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:34,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,318 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-21 21:40:34,405 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:34,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:34,405 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:34,406 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:34,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:34,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:34,409 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 3 states. [2018-07-21 21:40:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:34,523 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2018-07-21 21:40:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:34,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-07-21 21:40:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:34,525 INFO L225 Difference]: With dead ends: 146 [2018-07-21 21:40:34,525 INFO L226 Difference]: Without dead ends: 72 [2018-07-21 21:40:34,526 INFO L578 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 [2018-07-21 21:40:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-21 21:40:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-21 21:40:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-21 21:40:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-07-21 21:40:34,534 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2018-07-21 21:40:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:34,535 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-07-21 21:40:34,535 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-07-21 21:40:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-21 21:40:34,537 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:34,537 INFO L358 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:40:34,537 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -512664072, now seen corresponding path program 1 times [2018-07-21 21:40:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,539 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-21 21:40:34,594 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:34,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:34,594 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:34,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:34,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:34,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:34,596 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 3 states. [2018-07-21 21:40:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:34,815 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2018-07-21 21:40:34,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:34,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-07-21 21:40:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:34,817 INFO L225 Difference]: With dead ends: 192 [2018-07-21 21:40:34,817 INFO L226 Difference]: Without dead ends: 122 [2018-07-21 21:40:34,818 INFO L578 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 [2018-07-21 21:40:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-21 21:40:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-07-21 21:40:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-21 21:40:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-07-21 21:40:34,830 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2018-07-21 21:40:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:34,831 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-07-21 21:40:34,831 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-07-21 21:40:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-21 21:40:34,832 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:34,833 INFO L358 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:40:34,833 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:34,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1940953662, now seen corresponding path program 1 times [2018-07-21 21:40:34,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:34,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:34,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,835 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-21 21:40:34,911 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:34,911 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:34,911 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:34,912 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:34,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:34,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:34,913 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-07-21 21:40:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:34,974 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2018-07-21 21:40:34,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:34,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-07-21 21:40:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:34,976 INFO L225 Difference]: With dead ends: 183 [2018-07-21 21:40:34,977 INFO L226 Difference]: Without dead ends: 87 [2018-07-21 21:40:34,978 INFO L578 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 [2018-07-21 21:40:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-21 21:40:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-07-21 21:40:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-21 21:40:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2018-07-21 21:40:34,987 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2018-07-21 21:40:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:34,988 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2018-07-21 21:40:34,988 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2018-07-21 21:40:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-21 21:40:34,990 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:34,990 INFO L358 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:40:34,990 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1172052595, now seen corresponding path program 1 times [2018-07-21 21:40:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:34,992 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-21 21:40:35,041 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:35,041 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:35,041 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:35,042 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:35,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:35,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:35,042 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 3 states. [2018-07-21 21:40:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:35,097 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2018-07-21 21:40:35,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:35,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-07-21 21:40:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:35,099 INFO L225 Difference]: With dead ends: 134 [2018-07-21 21:40:35,099 INFO L226 Difference]: Without dead ends: 70 [2018-07-21 21:40:35,100 INFO L578 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 [2018-07-21 21:40:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-21 21:40:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-21 21:40:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-21 21:40:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2018-07-21 21:40:35,107 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2018-07-21 21:40:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:35,107 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2018-07-21 21:40:35,107 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2018-07-21 21:40:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-21 21:40:35,109 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:35,109 INFO L358 BasicCegarLoop]: trace histogram [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] [2018-07-21 21:40:35,109 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1320221367, now seen corresponding path program 1 times [2018-07-21 21:40:35,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:35,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:35,111 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-21 21:40:35,174 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:35,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:35,174 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:35,175 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:35,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:35,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:35,175 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 3 states. [2018-07-21 21:40:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:35,596 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2018-07-21 21:40:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:35,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-07-21 21:40:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:35,602 INFO L225 Difference]: With dead ends: 158 [2018-07-21 21:40:35,602 INFO L226 Difference]: Without dead ends: 111 [2018-07-21 21:40:35,602 INFO L578 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 [2018-07-21 21:40:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-21 21:40:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-07-21 21:40:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-21 21:40:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2018-07-21 21:40:35,614 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2018-07-21 21:40:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:35,615 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2018-07-21 21:40:35,615 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2018-07-21 21:40:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-21 21:40:35,616 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:35,617 INFO L358 BasicCegarLoop]: trace histogram [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] [2018-07-21 21:40:35,617 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1121323394, now seen corresponding path program 1 times [2018-07-21 21:40:35,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:35,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:35,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:35,619 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-21 21:40:35,690 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:35,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:35,690 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:35,691 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:35,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:35,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:35,691 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 3 states. [2018-07-21 21:40:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:35,853 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2018-07-21 21:40:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:35,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-07-21 21:40:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:35,869 INFO L225 Difference]: With dead ends: 166 [2018-07-21 21:40:35,869 INFO L226 Difference]: Without dead ends: 92 [2018-07-21 21:40:35,870 INFO L578 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 [2018-07-21 21:40:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-21 21:40:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-21 21:40:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-21 21:40:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2018-07-21 21:40:35,882 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2018-07-21 21:40:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:35,882 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2018-07-21 21:40:35,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-07-21 21:40:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-21 21:40:35,884 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:35,884 INFO L358 BasicCegarLoop]: trace histogram [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] [2018-07-21 21:40:35,884 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:35,885 INFO L82 PathProgramCache]: Analyzing trace with hash -984969239, now seen corresponding path program 1 times [2018-07-21 21:40:35,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:35,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:35,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:35,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:35,886 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-21 21:40:35,947 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:35,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:35,947 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:35,947 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:35,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:35,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:35,948 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 3 states. [2018-07-21 21:40:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:36,017 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2018-07-21 21:40:36,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:36,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-07-21 21:40:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:36,020 INFO L225 Difference]: With dead ends: 139 [2018-07-21 21:40:36,020 INFO L226 Difference]: Without dead ends: 72 [2018-07-21 21:40:36,021 INFO L578 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 [2018-07-21 21:40:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-21 21:40:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-21 21:40:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-21 21:40:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-07-21 21:40:36,027 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2018-07-21 21:40:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:36,028 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-07-21 21:40:36,028 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-07-21 21:40:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-21 21:40:36,030 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:36,030 INFO L358 BasicCegarLoop]: trace histogram [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] [2018-07-21 21:40:36,030 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 885900628, now seen corresponding path program 1 times [2018-07-21 21:40:36,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:36,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:36,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:36,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:36,032 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-21 21:40:36,085 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:36,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:36,085 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:36,085 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:36,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:36,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:36,086 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2018-07-21 21:40:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:36,329 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-07-21 21:40:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:36,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-07-21 21:40:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:36,331 INFO L225 Difference]: With dead ends: 74 [2018-07-21 21:40:36,331 INFO L226 Difference]: Without dead ends: 70 [2018-07-21 21:40:36,332 INFO L578 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 [2018-07-21 21:40:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-21 21:40:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-21 21:40:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-21 21:40:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-07-21 21:40:36,344 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2018-07-21 21:40:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:36,344 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-07-21 21:40:36,344 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-07-21 21:40:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-21 21:40:36,345 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:40:36,345 INFO L358 BasicCegarLoop]: trace histogram [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] [2018-07-21 21:40:36,345 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:40:36,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1704565915, now seen corresponding path program 1 times [2018-07-21 21:40:36,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-21 21:40:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:36,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:40:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:40:36,347 INFO L282 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-21 21:40:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:40:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-21 21:40:36,422 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:40:36,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:40:36,422 INFO L254 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-21 21:40:36,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:40:36,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:40:36,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:40:36,423 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-07-21 21:40:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:40:36,451 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2018-07-21 21:40:36,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:40:36,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-07-21 21:40:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:40:36,452 INFO L225 Difference]: With dead ends: 111 [2018-07-21 21:40:36,452 INFO L226 Difference]: Without dead ends: 0 [2018-07-21 21:40:36,452 INFO L578 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 [2018-07-21 21:40:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-21 21:40:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-21 21:40:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-21 21:40:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-21 21:40:36,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-07-21 21:40:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:40:36,454 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-21 21:40:36,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:40:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-21 21:40:36,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-21 21:40:36,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-21 21:40:36,578 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-07-21 21:40:36,578 INFO L424 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-07-21 21:40:36,578 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2018-07-21 21:40:36,578 INFO L421 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point mainErr0AssertViolationERROR_FUNCTION(line 389) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2018-07-21 21:40:36,579 INFO L421 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2018-07-21 21:40:36,580 INFO L417 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and .cse0 (= main_~q~0 2)) (and (= main_~q~0 3) (= main_~this_state~0 2)) (and .cse0 (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0)))) [2018-07-21 21:40:36,580 INFO L421 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L417 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L22'''(lines 22 385) no Hoare annotation was computed. [2018-07-21 21:40:36,581 INFO L421 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2018-07-21 21:40:36,582 INFO L421 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L417 ceAbstractionStarter]: At program point L22''(lines 22 385) the Hoare annotation is: (or (and (<= main_~this_state~0 0) (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0))) [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-07-21 21:40:36,583 INFO L421 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L424 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2018-07-21 21:40:36,584 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2018-07-21 21:40:36,585 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2018-07-21 21:40:36,585 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2018-07-21 21:40:36,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:40:36 BoogieIcfgContainer [2018-07-21 21:40:36,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-21 21:40:36,601 INFO L168 Benchmark]: Toolchain (without parser) took 4740.96 ms. Allocated memory was 306.2 MB in the beginning and 487.1 MB in the end (delta: 180.9 MB). Free memory was 252.6 MB in the beginning and 405.8 MB in the end (delta: -153.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. [2018-07-21 21:40:36,603 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-21 21:40:36,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.18 ms. Allocated memory is still 306.2 MB. Free memory was 252.6 MB in the beginning and 238.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-07-21 21:40:36,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.76 ms. Allocated memory is still 306.2 MB. Free memory was 238.5 MB in the beginning and 236.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-07-21 21:40:36,604 INFO L168 Benchmark]: Boogie Preprocessor took 74.17 ms. Allocated memory is still 306.2 MB. Free memory was 236.5 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-07-21 21:40:36,605 INFO L168 Benchmark]: RCFGBuilder took 1129.18 ms. Allocated memory was 306.2 MB in the beginning and 472.4 MB in the end (delta: 166.2 MB). Free memory was 234.6 MB in the beginning and 423.0 MB in the end (delta: -188.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-07-21 21:40:36,606 INFO L168 Benchmark]: TraceAbstraction took 3098.00 ms. Allocated memory was 472.4 MB in the beginning and 487.1 MB in the end (delta: 14.7 MB). Free memory was 423.0 MB in the beginning and 405.8 MB in the end (delta: 17.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 5.3 GB. [2018-07-21 21:40:36,610 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 385.18 ms. Allocated memory is still 306.2 MB. Free memory was 252.6 MB in the beginning and 238.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 43.76 ms. Allocated memory is still 306.2 MB. Free memory was 238.5 MB in the beginning and 236.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 74.17 ms. Allocated memory is still 306.2 MB. Free memory was 236.5 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1129.18 ms. Allocated memory was 306.2 MB in the beginning and 472.4 MB in the end (delta: 166.2 MB). Free memory was 234.6 MB in the beginning and 423.0 MB in the end (delta: -188.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3098.00 ms. Allocated memory was 472.4 MB in the beginning and 487.1 MB in the end (delta: 14.7 MB). Free memory was 423.0 MB in the beginning and 405.8 MB in the end (delta: 17.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 22]: Loop Invariant Derived loop invariant: (this_state <= 0 && q == 0) || (this_state == 3 && 4 <= q) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((this_state <= 0 && q == 2) || (q == 3 && this_state == 2)) || (this_state <= 0 && q == 0)) || (this_state == 3 && 4 <= q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1008 SDtfs, 337 SDslu, 455 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 49 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 10566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/psyco_security_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Taipan_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-21_21-40-36-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/psyco_security_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Taipan_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-21_21-40-36-624.csv Received shutdown request...