./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6dc0763a398b0a639e17ba351b312330c5e02cd6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:58:27,041 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:58:27,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:58:27,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:58:27,061 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:58:27,062 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:58:27,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:58:27,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:58:27,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:58:27,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:58:27,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:58:27,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:58:27,076 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:58:27,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:58:27,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:58:27,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:58:27,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:58:27,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:58:27,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:58:27,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:58:27,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:58:27,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:58:27,107 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:58:27,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:58:27,110 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:58:27,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:58:27,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:58:27,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:58:27,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:58:27,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:58:27,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:58:27,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:58:27,119 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:58:27,119 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:58:27,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:58:27,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:58:27,125 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:58:27,148 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:58:27,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:58:27,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:58:27,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:58:27,152 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:58:27,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:58:27,153 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:58:27,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:58:27,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:58:27,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:58:27,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:58:27,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:58:27,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:58:27,154 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:58:27,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:58:27,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:58:27,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:58:27,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:58:27,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:58:27,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:58:27,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:58:27,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:58:27,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:58:27,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:58:27,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:58:27,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:58:27,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:58:27,158 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6dc0763a398b0a639e17ba351b312330c5e02cd6 [2019-01-14 14:58:27,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:58:27,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:58:27,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:58:27,243 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:58:27,244 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:58:27,244 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:27,308 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f7bd1e9/5ace3d153a0e445f8a637cd2904e1883/FLAG38af0ac7b [2019-01-14 14:58:27,787 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:58:27,788 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:27,800 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f7bd1e9/5ace3d153a0e445f8a637cd2904e1883/FLAG38af0ac7b [2019-01-14 14:58:28,117 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f7bd1e9/5ace3d153a0e445f8a637cd2904e1883 [2019-01-14 14:58:28,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:58:28,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:58:28,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:28,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:58:28,127 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:58:28,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c13baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28, skipping insertion in model container [2019-01-14 14:58:28,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:58:28,192 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:58:28,484 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:28,489 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:58:28,586 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:28,608 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:58:28,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28 WrapperNode [2019-01-14 14:58:28,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:28,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:28,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:58:28,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:58:28,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:28,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:58:28,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:58:28,774 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:58:28,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (1/1) ... [2019-01-14 14:58:28,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:58:28,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:58:28,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:58:28,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:58:28,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (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-01-14 14:58:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:58:28,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:58:29,047 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:58:30,154 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-14 14:58:30,155 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-14 14:58:30,156 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:58:30,156 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:58:30,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:30 BoogieIcfgContainer [2019-01-14 14:58:30,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:58:30,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:58:30,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:58:30,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:58:30,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:58:28" (1/3) ... [2019-01-14 14:58:30,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a468472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:30, skipping insertion in model container [2019-01-14 14:58:30,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:28" (2/3) ... [2019-01-14 14:58:30,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a468472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:30, skipping insertion in model container [2019-01-14 14:58:30,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:30" (3/3) ... [2019-01-14 14:58:30,166 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:30,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:58:30,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:58:30,197 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:58:30,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:58:30,228 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:58:30,228 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:58:30,228 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:58:30,228 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:58:30,228 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:58:30,229 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:58:30,229 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:58:30,229 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:58:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-01-14 14:58:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 14:58:30,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:30,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:30,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-01-14 14:58:30,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:30,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:30,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:30,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:30,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:30,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:30,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:30,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:30,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:30,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:30,588 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-01-14 14:58:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:31,409 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-01-14 14:58:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:31,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-14 14:58:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:31,427 INFO L225 Difference]: With dead ends: 327 [2019-01-14 14:58:31,427 INFO L226 Difference]: Without dead ends: 174 [2019-01-14 14:58:31,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-14 14:58:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-01-14 14:58:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-14 14:58:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-01-14 14:58:31,490 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-01-14 14:58:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:31,491 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-01-14 14:58:31,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-01-14 14:58:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 14:58:31,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:31,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:31,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:31,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-01-14 14:58:31,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:31,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:31,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:31,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:31,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:31,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:31,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:31,631 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-01-14 14:58:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:32,072 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-01-14 14:58:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:32,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-14 14:58:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:32,076 INFO L225 Difference]: With dead ends: 379 [2019-01-14 14:58:32,076 INFO L226 Difference]: Without dead ends: 215 [2019-01-14 14:58:32,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-14 14:58:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-01-14 14:58:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 14:58:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-01-14 14:58:32,103 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-01-14 14:58:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:32,103 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-01-14 14:58:32,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-01-14 14:58:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 14:58:32,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:32,112 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:32,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:32,114 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-01-14 14:58:32,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:32,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:32,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:32,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:32,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:32,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:32,241 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-01-14 14:58:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:32,565 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-01-14 14:58:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:32,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-14 14:58:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:32,570 INFO L225 Difference]: With dead ends: 444 [2019-01-14 14:58:32,570 INFO L226 Difference]: Without dead ends: 241 [2019-01-14 14:58:32,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-14 14:58:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-14 14:58:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-14 14:58:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-01-14 14:58:32,589 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-01-14 14:58:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:32,590 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-01-14 14:58:32,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-01-14 14:58:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:58:32,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:32,595 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:32,595 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:32,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-01-14 14:58:32,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:32,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:32,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:32,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:32,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:32,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:32,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:32,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:32,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:32,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:32,664 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-01-14 14:58:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:32,963 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-01-14 14:58:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:32,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:58:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:32,965 INFO L225 Difference]: With dead ends: 492 [2019-01-14 14:58:32,965 INFO L226 Difference]: Without dead ends: 258 [2019-01-14 14:58:32,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-14 14:58:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-01-14 14:58:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-14 14:58:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-01-14 14:58:32,990 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-01-14 14:58:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:32,990 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-01-14 14:58:32,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-01-14 14:58:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:58:32,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:32,993 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:32,993 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-01-14 14:58:32,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:32,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:32,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:32,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:33,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:33,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:33,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:33,121 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-01-14 14:58:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:33,423 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-01-14 14:58:33,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:33,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:58:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:33,427 INFO L225 Difference]: With dead ends: 551 [2019-01-14 14:58:33,428 INFO L226 Difference]: Without dead ends: 302 [2019-01-14 14:58:33,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-14 14:58:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-01-14 14:58:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-14 14:58:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-01-14 14:58:33,444 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-01-14 14:58:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:33,445 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-01-14 14:58:33,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-01-14 14:58:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:58:33,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:33,447 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:33,447 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-01-14 14:58:33,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:33,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:33,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:33,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:33,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:33,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:33,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:33,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:33,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:33,531 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-01-14 14:58:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:33,988 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-01-14 14:58:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:33,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:58:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:33,990 INFO L225 Difference]: With dead ends: 591 [2019-01-14 14:58:33,991 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 14:58:33,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 14:58:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-14 14:58:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-14 14:58:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-01-14 14:58:34,003 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-01-14 14:58:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:34,003 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-01-14 14:58:34,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-01-14 14:58:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:58:34,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:34,005 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-14 14:58:34,005 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:34,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-01-14 14:58:34,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:34,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:34,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:34,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:34,059 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-01-14 14:58:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:34,748 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-01-14 14:58:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:34,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:58:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:34,753 INFO L225 Difference]: With dead ends: 593 [2019-01-14 14:58:34,753 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 14:58:34,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 14:58:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-01-14 14:58:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-14 14:58:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-01-14 14:58:34,765 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-01-14 14:58:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:34,765 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-01-14 14:58:34,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-01-14 14:58:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 14:58:34,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:34,767 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:34,767 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:34,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-01-14 14:58:34,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:34,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-14 14:58:34,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:34,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:34,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:34,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:34,851 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-01-14 14:58:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:35,151 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-14 14:58:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:35,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-14 14:58:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:35,154 INFO L225 Difference]: With dead ends: 594 [2019-01-14 14:58:35,155 INFO L226 Difference]: Without dead ends: 305 [2019-01-14 14:58:35,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-14 14:58:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-01-14 14:58:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 14:58:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-01-14 14:58:35,170 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-01-14 14:58:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:35,170 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-01-14 14:58:35,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-01-14 14:58:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 14:58:35,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:35,172 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:35,172 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-01-14 14:58:35,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:35,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:35,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:35,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:35,292 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-01-14 14:58:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:36,423 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-01-14 14:58:36,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:36,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-14 14:58:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:36,429 INFO L225 Difference]: With dead ends: 634 [2019-01-14 14:58:36,430 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 14:58:36,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 14:58:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 14:58:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 14:58:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-01-14 14:58:36,443 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-01-14 14:58:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:36,443 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-01-14 14:58:36,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-01-14 14:58:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 14:58:36,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:36,447 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:36,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-01-14 14:58:36,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:36,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:36,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:36,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:36,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:36,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:36,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:36,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:36,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:36,558 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-01-14 14:58:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:37,215 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-01-14 14:58:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:37,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 14:58:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:37,220 INFO L225 Difference]: With dead ends: 663 [2019-01-14 14:58:37,220 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 14:58:37,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 14:58:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 14:58:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 14:58:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-01-14 14:58:37,233 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-01-14 14:58:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:37,233 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-01-14 14:58:37,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-01-14 14:58:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 14:58:37,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:37,237 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:37,237 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:37,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-01-14 14:58:37,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:37,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:37,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:37,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:37,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:37,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:37,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:37,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:37,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:37,334 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-01-14 14:58:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:38,041 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-01-14 14:58:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:38,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-14 14:58:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:38,043 INFO L225 Difference]: With dead ends: 696 [2019-01-14 14:58:38,043 INFO L226 Difference]: Without dead ends: 369 [2019-01-14 14:58:38,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-14 14:58:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-14 14:58:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-14 14:58:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-01-14 14:58:38,057 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-01-14 14:58:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:38,057 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-01-14 14:58:38,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-01-14 14:58:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 14:58:38,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:38,059 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:38,059 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-01-14 14:58:38,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:38,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:38,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:38,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:38,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:38,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:38,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:38,152 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-01-14 14:58:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:38,768 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-01-14 14:58:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:38,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-14 14:58:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:38,771 INFO L225 Difference]: With dead ends: 723 [2019-01-14 14:58:38,771 INFO L226 Difference]: Without dead ends: 369 [2019-01-14 14:58:38,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-14 14:58:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-14 14:58:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-14 14:58:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-01-14 14:58:38,784 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-01-14 14:58:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:38,784 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-01-14 14:58:38,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-01-14 14:58:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 14:58:38,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:38,786 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:38,786 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-01-14 14:58:38,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:38,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:38,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:38,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:38,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:38,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:38,850 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-01-14 14:58:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:39,438 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-01-14 14:58:39,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:39,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 14:58:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:39,441 INFO L225 Difference]: With dead ends: 741 [2019-01-14 14:58:39,441 INFO L226 Difference]: Without dead ends: 387 [2019-01-14 14:58:39,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-01-14 14:58:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-01-14 14:58:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-14 14:58:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-01-14 14:58:39,457 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-01-14 14:58:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:39,457 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-01-14 14:58:39,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-01-14 14:58:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 14:58:39,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:39,459 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:39,460 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:39,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-01-14 14:58:39,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:39,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:39,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:39,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:39,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:39,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:39,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:39,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:39,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:39,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:39,566 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-01-14 14:58:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:40,083 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-01-14 14:58:40,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:40,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-14 14:58:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:40,087 INFO L225 Difference]: With dead ends: 762 [2019-01-14 14:58:40,087 INFO L226 Difference]: Without dead ends: 387 [2019-01-14 14:58:40,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-01-14 14:58:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-01-14 14:58:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-14 14:58:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-01-14 14:58:40,100 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-01-14 14:58:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:40,104 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-01-14 14:58:40,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-01-14 14:58:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-14 14:58:40,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:40,106 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:40,107 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-01-14 14:58:40,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:40,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:40,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:40,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 14:58:40,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:40,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:40,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:40,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,226 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-01-14 14:58:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:40,369 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-01-14 14:58:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:40,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-14 14:58:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:40,373 INFO L225 Difference]: With dead ends: 757 [2019-01-14 14:58:40,374 INFO L226 Difference]: Without dead ends: 755 [2019-01-14 14:58:40,374 INFO L631 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-01-14 14:58:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-01-14 14:58:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-01-14 14:58:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-01-14 14:58:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-01-14 14:58:40,397 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-01-14 14:58:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:40,397 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-01-14 14:58:40,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-01-14 14:58:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-14 14:58:40,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:40,400 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:40,400 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:40,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1007661097, now seen corresponding path program 1 times [2019-01-14 14:58:40,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:40,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:40,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:40,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:40,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:40,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:40,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,477 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-01-14 14:58:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:40,613 INFO L93 Difference]: Finished difference Result 1871 states and 2963 transitions. [2019-01-14 14:58:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:40,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-14 14:58:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:40,620 INFO L225 Difference]: With dead ends: 1871 [2019-01-14 14:58:40,620 INFO L226 Difference]: Without dead ends: 1123 [2019-01-14 14:58:40,623 INFO L631 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-01-14 14:58:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-01-14 14:58:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-01-14 14:58:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-01-14 14:58:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1776 transitions. [2019-01-14 14:58:40,659 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1776 transitions. Word has length 121 [2019-01-14 14:58:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:40,660 INFO L480 AbstractCegarLoop]: Abstraction has 1123 states and 1776 transitions. [2019-01-14 14:58:40,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1776 transitions. [2019-01-14 14:58:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-14 14:58:40,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:40,665 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:40,665 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 381632917, now seen corresponding path program 1 times [2019-01-14 14:58:40,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:40,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-14 14:58:40,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:40,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:40,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,749 INFO L87 Difference]: Start difference. First operand 1123 states and 1776 transitions. Second operand 3 states. [2019-01-14 14:58:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:41,024 INFO L93 Difference]: Finished difference Result 2590 states and 4096 transitions. [2019-01-14 14:58:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:41,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-14 14:58:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:41,032 INFO L225 Difference]: With dead ends: 2590 [2019-01-14 14:58:41,032 INFO L226 Difference]: Without dead ends: 1474 [2019-01-14 14:58:41,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 14:58:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-01-14 14:58:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2019-01-14 14:58:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-01-14 14:58:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2327 transitions. [2019-01-14 14:58:41,094 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2327 transitions. Word has length 121 [2019-01-14 14:58:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:41,094 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 2327 transitions. [2019-01-14 14:58:41,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2327 transitions. [2019-01-14 14:58:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-14 14:58:41,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:41,101 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:41,101 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:41,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:41,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2067443667, now seen corresponding path program 1 times [2019-01-14 14:58:41,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:41,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:41,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-14 14:58:41,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:41,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:41,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:41,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:41,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:41,211 INFO L87 Difference]: Start difference. First operand 1474 states and 2327 transitions. Second operand 3 states. [2019-01-14 14:58:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:42,524 INFO L93 Difference]: Finished difference Result 2981 states and 4691 transitions. [2019-01-14 14:58:42,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:42,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-14 14:58:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:42,534 INFO L225 Difference]: With dead ends: 2981 [2019-01-14 14:58:42,534 INFO L226 Difference]: Without dead ends: 1514 [2019-01-14 14:58:42,537 INFO L631 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-01-14 14:58:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-01-14 14:58:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1474. [2019-01-14 14:58:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-01-14 14:58:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2183 transitions. [2019-01-14 14:58:42,598 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2183 transitions. Word has length 158 [2019-01-14 14:58:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:42,599 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 2183 transitions. [2019-01-14 14:58:42,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2183 transitions. [2019-01-14 14:58:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-14 14:58:42,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:42,609 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:42,609 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1134888427, now seen corresponding path program 1 times [2019-01-14 14:58:42,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:42,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:42,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-14 14:58:42,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:42,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:42,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:42,749 INFO L87 Difference]: Start difference. First operand 1474 states and 2183 transitions. Second operand 3 states. [2019-01-14 14:58:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:43,357 INFO L93 Difference]: Finished difference Result 3137 states and 4655 transitions. [2019-01-14 14:58:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:43,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-14 14:58:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:43,363 INFO L225 Difference]: With dead ends: 3137 [2019-01-14 14:58:43,363 INFO L226 Difference]: Without dead ends: 1670 [2019-01-14 14:58:43,366 INFO L631 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-01-14 14:58:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-01-14 14:58:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1554. [2019-01-14 14:58:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-01-14 14:58:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2243 transitions. [2019-01-14 14:58:43,411 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2243 transitions. Word has length 158 [2019-01-14 14:58:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:43,411 INFO L480 AbstractCegarLoop]: Abstraction has 1554 states and 2243 transitions. [2019-01-14 14:58:43,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2243 transitions. [2019-01-14 14:58:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-14 14:58:43,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:43,417 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:43,417 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:43,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1894065177, now seen corresponding path program 1 times [2019-01-14 14:58:43,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:43,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:43,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:43,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 14:58:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:43,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:43,503 INFO L87 Difference]: Start difference. First operand 1554 states and 2243 transitions. Second operand 3 states. [2019-01-14 14:58:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:43,810 INFO L93 Difference]: Finished difference Result 3157 states and 4541 transitions. [2019-01-14 14:58:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:43,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-01-14 14:58:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:43,819 INFO L225 Difference]: With dead ends: 3157 [2019-01-14 14:58:43,819 INFO L226 Difference]: Without dead ends: 1610 [2019-01-14 14:58:43,821 INFO L631 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-01-14 14:58:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-01-14 14:58:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1554. [2019-01-14 14:58:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-01-14 14:58:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2181 transitions. [2019-01-14 14:58:43,868 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2181 transitions. Word has length 172 [2019-01-14 14:58:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:43,869 INFO L480 AbstractCegarLoop]: Abstraction has 1554 states and 2181 transitions. [2019-01-14 14:58:43,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2181 transitions. [2019-01-14 14:58:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-14 14:58:43,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:43,873 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:43,873 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -313542519, now seen corresponding path program 1 times [2019-01-14 14:58:43,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-14 14:58:43,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:43,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:43,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:43,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:43,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:43,965 INFO L87 Difference]: Start difference. First operand 1554 states and 2181 transitions. Second operand 3 states. [2019-01-14 14:58:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:44,146 INFO L93 Difference]: Finished difference Result 3186 states and 4458 transitions. [2019-01-14 14:58:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:44,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-01-14 14:58:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:44,154 INFO L225 Difference]: With dead ends: 3186 [2019-01-14 14:58:44,154 INFO L226 Difference]: Without dead ends: 1639 [2019-01-14 14:58:44,156 INFO L631 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-01-14 14:58:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-01-14 14:58:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-01-14 14:58:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-01-14 14:58:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2265 transitions. [2019-01-14 14:58:44,200 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2265 transitions. Word has length 188 [2019-01-14 14:58:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:44,201 INFO L480 AbstractCegarLoop]: Abstraction has 1623 states and 2265 transitions. [2019-01-14 14:58:44,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2265 transitions. [2019-01-14 14:58:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-14 14:58:44,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:44,207 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:44,207 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1889247393, now seen corresponding path program 1 times [2019-01-14 14:58:44,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:44,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:44,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-01-14 14:58:44,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:44,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:44,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:44,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,280 INFO L87 Difference]: Start difference. First operand 1623 states and 2265 transitions. Second operand 3 states. [2019-01-14 14:58:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:44,533 INFO L93 Difference]: Finished difference Result 3391 states and 4735 transitions. [2019-01-14 14:58:44,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:44,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-01-14 14:58:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:44,545 INFO L225 Difference]: With dead ends: 3391 [2019-01-14 14:58:44,545 INFO L226 Difference]: Without dead ends: 1775 [2019-01-14 14:58:44,547 INFO L631 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-01-14 14:58:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-01-14 14:58:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1723. [2019-01-14 14:58:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-01-14 14:58:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2385 transitions. [2019-01-14 14:58:44,596 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2385 transitions. Word has length 209 [2019-01-14 14:58:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:44,596 INFO L480 AbstractCegarLoop]: Abstraction has 1723 states and 2385 transitions. [2019-01-14 14:58:44,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2385 transitions. [2019-01-14 14:58:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-14 14:58:44,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:44,602 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:44,602 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:44,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash 627964964, now seen corresponding path program 1 times [2019-01-14 14:58:44,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:44,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:44,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-14 14:58:44,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:44,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:44,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,705 INFO L87 Difference]: Start difference. First operand 1723 states and 2385 transitions. Second operand 3 states. [2019-01-14 14:58:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:45,004 INFO L93 Difference]: Finished difference Result 3493 states and 4821 transitions. [2019-01-14 14:58:45,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:45,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-01-14 14:58:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:45,013 INFO L225 Difference]: With dead ends: 3493 [2019-01-14 14:58:45,014 INFO L226 Difference]: Without dead ends: 1777 [2019-01-14 14:58:45,016 INFO L631 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-01-14 14:58:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-01-14 14:58:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1723. [2019-01-14 14:58:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-01-14 14:58:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2377 transitions. [2019-01-14 14:58:45,067 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2377 transitions. Word has length 212 [2019-01-14 14:58:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:45,067 INFO L480 AbstractCegarLoop]: Abstraction has 1723 states and 2377 transitions. [2019-01-14 14:58:45,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2377 transitions. [2019-01-14 14:58:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-14 14:58:45,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:45,074 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:45,074 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:45,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 575806657, now seen corresponding path program 1 times [2019-01-14 14:58:45,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:45,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-01-14 14:58:45,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:45,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:45,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,206 INFO L87 Difference]: Start difference. First operand 1723 states and 2377 transitions. Second operand 3 states. [2019-01-14 14:58:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:45,392 INFO L93 Difference]: Finished difference Result 3635 states and 5035 transitions. [2019-01-14 14:58:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:45,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-01-14 14:58:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:45,398 INFO L225 Difference]: With dead ends: 3635 [2019-01-14 14:58:45,398 INFO L226 Difference]: Without dead ends: 1819 [2019-01-14 14:58:45,400 INFO L631 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-01-14 14:58:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-01-14 14:58:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1779. [2019-01-14 14:58:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-01-14 14:58:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2421 transitions. [2019-01-14 14:58:45,446 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2421 transitions. Word has length 233 [2019-01-14 14:58:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:45,447 INFO L480 AbstractCegarLoop]: Abstraction has 1779 states and 2421 transitions. [2019-01-14 14:58:45,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2421 transitions. [2019-01-14 14:58:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-14 14:58:45,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:45,453 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:45,453 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 274134262, now seen corresponding path program 1 times [2019-01-14 14:58:45,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:45,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:45,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-01-14 14:58:45,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:45,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:45,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:45,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:45,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,571 INFO L87 Difference]: Start difference. First operand 1779 states and 2421 transitions. Second operand 3 states. [2019-01-14 14:58:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:45,822 INFO L93 Difference]: Finished difference Result 3583 states and 4883 transitions. [2019-01-14 14:58:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:45,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-01-14 14:58:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:45,830 INFO L225 Difference]: With dead ends: 3583 [2019-01-14 14:58:45,830 INFO L226 Difference]: Without dead ends: 1811 [2019-01-14 14:58:45,832 INFO L631 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-01-14 14:58:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-01-14 14:58:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1779. [2019-01-14 14:58:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-01-14 14:58:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2401 transitions. [2019-01-14 14:58:45,878 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2401 transitions. Word has length 235 [2019-01-14 14:58:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:45,878 INFO L480 AbstractCegarLoop]: Abstraction has 1779 states and 2401 transitions. [2019-01-14 14:58:45,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2401 transitions. [2019-01-14 14:58:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-14 14:58:45,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:45,883 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 14:58:45,884 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:45,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2133876990, now seen corresponding path program 1 times [2019-01-14 14:58:45,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:45,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-01-14 14:58:46,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:46,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:46,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:46,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-01-14 14:58:46,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:58:46,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:58:46,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:58:46,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:58:46,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:46,442 INFO L87 Difference]: Start difference. First operand 1779 states and 2401 transitions. Second operand 5 states. [2019-01-14 14:58:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:50,409 INFO L93 Difference]: Finished difference Result 6493 states and 8797 transitions. [2019-01-14 14:58:50,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 14:58:50,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-01-14 14:58:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:50,441 INFO L225 Difference]: With dead ends: 6493 [2019-01-14 14:58:50,441 INFO L226 Difference]: Without dead ends: 4721 [2019-01-14 14:58:50,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 14:58:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2019-01-14 14:58:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 2594. [2019-01-14 14:58:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2594 states. [2019-01-14 14:58:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3456 transitions. [2019-01-14 14:58:50,543 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3456 transitions. Word has length 245 [2019-01-14 14:58:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:50,544 INFO L480 AbstractCegarLoop]: Abstraction has 2594 states and 3456 transitions. [2019-01-14 14:58:50,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:58:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3456 transitions. [2019-01-14 14:58:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-14 14:58:50,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:50,552 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:50,553 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash 81780885, now seen corresponding path program 1 times [2019-01-14 14:58:50,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:50,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:50,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:50,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:50,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-14 14:58:50,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:50,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:50,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:50,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:50,700 INFO L87 Difference]: Start difference. First operand 2594 states and 3456 transitions. Second operand 3 states. [2019-01-14 14:58:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:50,983 INFO L93 Difference]: Finished difference Result 7608 states and 10161 transitions. [2019-01-14 14:58:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:50,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-01-14 14:58:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:50,997 INFO L225 Difference]: With dead ends: 7608 [2019-01-14 14:58:50,997 INFO L226 Difference]: Without dead ends: 5021 [2019-01-14 14:58:51,002 INFO L631 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-01-14 14:58:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2019-01-14 14:58:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 5019. [2019-01-14 14:58:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5019 states. [2019-01-14 14:58:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 6701 transitions. [2019-01-14 14:58:51,159 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 6701 transitions. Word has length 252 [2019-01-14 14:58:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:51,160 INFO L480 AbstractCegarLoop]: Abstraction has 5019 states and 6701 transitions. [2019-01-14 14:58:51,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 6701 transitions. [2019-01-14 14:58:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-14 14:58:51,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:51,169 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:51,169 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:51,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1389751562, now seen corresponding path program 1 times [2019-01-14 14:58:51,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:51,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:51,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:51,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-01-14 14:58:51,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:51,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:51,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:51,282 INFO L87 Difference]: Start difference. First operand 5019 states and 6701 transitions. Second operand 3 states. [2019-01-14 14:58:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:51,999 INFO L93 Difference]: Finished difference Result 10131 states and 13511 transitions. [2019-01-14 14:58:52,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:52,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-01-14 14:58:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:52,011 INFO L225 Difference]: With dead ends: 10131 [2019-01-14 14:58:52,013 INFO L226 Difference]: Without dead ends: 5119 [2019-01-14 14:58:52,018 INFO L631 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-01-14 14:58:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-01-14 14:58:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 5019. [2019-01-14 14:58:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5019 states. [2019-01-14 14:58:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 6605 transitions. [2019-01-14 14:58:52,181 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 6605 transitions. Word has length 255 [2019-01-14 14:58:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:52,181 INFO L480 AbstractCegarLoop]: Abstraction has 5019 states and 6605 transitions. [2019-01-14 14:58:52,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 6605 transitions. [2019-01-14 14:58:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-14 14:58:52,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:52,192 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:52,193 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:52,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:52,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1038896286, now seen corresponding path program 1 times [2019-01-14 14:58:52,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:52,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-01-14 14:58:52,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:52,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:52,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:52,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-01-14 14:58:52,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:58:52,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:58:52,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:58:52,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:58:52,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:52,767 INFO L87 Difference]: Start difference. First operand 5019 states and 6605 transitions. Second operand 5 states. [2019-01-14 14:58:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:54,075 INFO L93 Difference]: Finished difference Result 11259 states and 14684 transitions. [2019-01-14 14:58:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 14:58:54,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 281 [2019-01-14 14:58:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:54,088 INFO L225 Difference]: With dead ends: 11259 [2019-01-14 14:58:54,088 INFO L226 Difference]: Without dead ends: 6181 [2019-01-14 14:58:54,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 14:58:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6181 states. [2019-01-14 14:58:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6181 to 3938. [2019-01-14 14:58:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3938 states. [2019-01-14 14:58:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5049 transitions. [2019-01-14 14:58:54,243 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5049 transitions. Word has length 281 [2019-01-14 14:58:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:54,243 INFO L480 AbstractCegarLoop]: Abstraction has 3938 states and 5049 transitions. [2019-01-14 14:58:54,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:58:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5049 transitions. [2019-01-14 14:58:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-14 14:58:54,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:54,251 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:54,252 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -619184365, now seen corresponding path program 1 times [2019-01-14 14:58:54,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:54,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 644 proven. 26 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-01-14 14:58:54,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:54,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:54,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:54,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-01-14 14:58:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:58:54,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:58:54,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:58:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:58:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:54,793 INFO L87 Difference]: Start difference. First operand 3938 states and 5049 transitions. Second operand 5 states. [2019-01-14 14:58:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:55,447 INFO L93 Difference]: Finished difference Result 10919 states and 14092 transitions. [2019-01-14 14:58:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 14:58:55,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 298 [2019-01-14 14:58:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:55,462 INFO L225 Difference]: With dead ends: 10919 [2019-01-14 14:58:55,462 INFO L226 Difference]: Without dead ends: 6988 [2019-01-14 14:58:55,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 14:58:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2019-01-14 14:58:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 4668. [2019-01-14 14:58:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4668 states. [2019-01-14 14:58:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4668 states to 4668 states and 5903 transitions. [2019-01-14 14:58:55,646 INFO L78 Accepts]: Start accepts. Automaton has 4668 states and 5903 transitions. Word has length 298 [2019-01-14 14:58:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:55,647 INFO L480 AbstractCegarLoop]: Abstraction has 4668 states and 5903 transitions. [2019-01-14 14:58:55,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:58:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4668 states and 5903 transitions. [2019-01-14 14:58:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-14 14:58:55,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:55,660 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:55,660 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:55,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash -68994562, now seen corresponding path program 1 times [2019-01-14 14:58:55,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:55,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-01-14 14:58:55,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:55,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:55,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:55,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:55,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:55,801 INFO L87 Difference]: Start difference. First operand 4668 states and 5903 transitions. Second operand 3 states. [2019-01-14 14:58:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:56,578 INFO L93 Difference]: Finished difference Result 7999 states and 10060 transitions. [2019-01-14 14:58:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:56,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-01-14 14:58:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:56,583 INFO L225 Difference]: With dead ends: 7999 [2019-01-14 14:58:56,584 INFO L226 Difference]: Without dead ends: 2530 [2019-01-14 14:58:56,589 INFO L631 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-01-14 14:58:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-01-14 14:58:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2019-01-14 14:58:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-01-14 14:58:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3179 transitions. [2019-01-14 14:58:56,790 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3179 transitions. Word has length 320 [2019-01-14 14:58:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:56,790 INFO L480 AbstractCegarLoop]: Abstraction has 2530 states and 3179 transitions. [2019-01-14 14:58:56,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3179 transitions. [2019-01-14 14:58:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-01-14 14:58:56,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:56,801 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:56,801 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:56,804 INFO L82 PathProgramCache]: Analyzing trace with hash 439442017, now seen corresponding path program 1 times [2019-01-14 14:58:56,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:56,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-01-14 14:58:56,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:56,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:56,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:56,979 INFO L87 Difference]: Start difference. First operand 2530 states and 3179 transitions. Second operand 3 states. [2019-01-14 14:58:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:57,219 INFO L93 Difference]: Finished difference Result 5063 states and 6357 transitions. [2019-01-14 14:58:57,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:57,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-01-14 14:58:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:57,227 INFO L225 Difference]: With dead ends: 5063 [2019-01-14 14:58:57,227 INFO L226 Difference]: Without dead ends: 2540 [2019-01-14 14:58:57,231 INFO L631 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-01-14 14:58:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2019-01-14 14:58:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2530. [2019-01-14 14:58:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-01-14 14:58:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3154 transitions. [2019-01-14 14:58:57,312 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3154 transitions. Word has length 359 [2019-01-14 14:58:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:57,313 INFO L480 AbstractCegarLoop]: Abstraction has 2530 states and 3154 transitions. [2019-01-14 14:58:57,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3154 transitions. [2019-01-14 14:58:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-14 14:58:57,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:57,321 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:57,321 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:57,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:57,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1924130447, now seen corresponding path program 1 times [2019-01-14 14:58:57,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:57,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:57,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-14 14:58:57,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:57,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:57,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:57,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-01-14 14:58:57,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:58:57,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:58:57,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:58:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:58:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:57,894 INFO L87 Difference]: Start difference. First operand 2530 states and 3154 transitions. Second operand 5 states. [2019-01-14 14:58:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:59,707 INFO L93 Difference]: Finished difference Result 6625 states and 8263 transitions. [2019-01-14 14:58:59,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 14:58:59,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-01-14 14:58:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:59,713 INFO L225 Difference]: With dead ends: 6625 [2019-01-14 14:58:59,713 INFO L226 Difference]: Without dead ends: 4048 [2019-01-14 14:58:59,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 14:58:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2019-01-14 14:58:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 2600. [2019-01-14 14:58:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2019-01-14 14:58:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3238 transitions. [2019-01-14 14:58:59,815 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3238 transitions. Word has length 392 [2019-01-14 14:58:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:59,815 INFO L480 AbstractCegarLoop]: Abstraction has 2600 states and 3238 transitions. [2019-01-14 14:58:59,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:58:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3238 transitions. [2019-01-14 14:58:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-01-14 14:58:59,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:59,824 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:59,824 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:59,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash -751360217, now seen corresponding path program 1 times [2019-01-14 14:58:59,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:59,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:59,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-01-14 14:59:00,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:00,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:00,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:00,075 INFO L87 Difference]: Start difference. First operand 2600 states and 3238 transitions. Second operand 3 states. [2019-01-14 14:59:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:00,270 INFO L93 Difference]: Finished difference Result 5373 states and 6685 transitions. [2019-01-14 14:59:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:00,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 594 [2019-01-14 14:59:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:00,274 INFO L225 Difference]: With dead ends: 5373 [2019-01-14 14:59:00,274 INFO L226 Difference]: Without dead ends: 2780 [2019-01-14 14:59:00,276 INFO L631 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-01-14 14:59:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-01-14 14:59:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2770. [2019-01-14 14:59:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2019-01-14 14:59:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3433 transitions. [2019-01-14 14:59:00,376 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3433 transitions. Word has length 594 [2019-01-14 14:59:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:00,377 INFO L480 AbstractCegarLoop]: Abstraction has 2770 states and 3433 transitions. [2019-01-14 14:59:00,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3433 transitions. [2019-01-14 14:59:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-01-14 14:59:00,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:00,425 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:00,425 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1835833869, now seen corresponding path program 1 times [2019-01-14 14:59:00,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:00,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:00,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:00,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:00,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-01-14 14:59:00,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:00,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:00,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:00,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:00,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:00,661 INFO L87 Difference]: Start difference. First operand 2770 states and 3433 transitions. Second operand 3 states. [2019-01-14 14:59:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:00,856 INFO L93 Difference]: Finished difference Result 5528 states and 6845 transitions. [2019-01-14 14:59:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:00,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 656 [2019-01-14 14:59:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:00,860 INFO L225 Difference]: With dead ends: 5528 [2019-01-14 14:59:00,860 INFO L226 Difference]: Without dead ends: 2765 [2019-01-14 14:59:00,864 INFO L631 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-01-14 14:59:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2019-01-14 14:59:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2765. [2019-01-14 14:59:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2019-01-14 14:59:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3398 transitions. [2019-01-14 14:59:00,923 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3398 transitions. Word has length 656 [2019-01-14 14:59:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:00,924 INFO L480 AbstractCegarLoop]: Abstraction has 2765 states and 3398 transitions. [2019-01-14 14:59:00,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3398 transitions. [2019-01-14 14:59:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-01-14 14:59:00,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:00,930 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:00,930 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1388787143, now seen corresponding path program 1 times [2019-01-14 14:59:00,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:00,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:00,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:00,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:00,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-01-14 14:59:01,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:59:01,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:59:01,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:01,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:59:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-01-14 14:59:01,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:59:01,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:59:01,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:59:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:59:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:59:01,777 INFO L87 Difference]: Start difference. First operand 2765 states and 3398 transitions. Second operand 4 states. [2019-01-14 14:59:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:01,985 INFO L93 Difference]: Finished difference Result 4407 states and 5413 transitions. [2019-01-14 14:59:01,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 14:59:01,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 722 [2019-01-14 14:59:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:01,986 INFO L225 Difference]: With dead ends: 4407 [2019-01-14 14:59:01,987 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 14:59:01,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:59:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 14:59:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 14:59:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 14:59:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 14:59:01,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 722 [2019-01-14 14:59:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:01,991 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 14:59:01,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:59:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 14:59:01,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 14:59:01,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 14:59:02,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,592 WARN L181 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 290 [2019-01-14 14:59:03,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,487 WARN L181 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 450 DAG size of output: 290 [2019-01-14 14:59:04,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:05,475 WARN L181 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-01-14 14:59:05,913 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2019-01-14 14:59:06,106 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-01-14 14:59:06,302 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2019-01-14 14:59:06,711 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 25 [2019-01-14 14:59:07,012 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 29 [2019-01-14 14:59:07,296 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-01-14 14:59:07,493 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 19 [2019-01-14 14:59:07,692 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2019-01-14 14:59:07,967 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-01-14 14:59:08,318 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 32 [2019-01-14 14:59:08,581 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 20 [2019-01-14 14:59:12,602 WARN L181 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 246 DAG size of output: 113 [2019-01-14 14:59:12,776 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-01-14 14:59:16,597 WARN L181 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 246 DAG size of output: 115 [2019-01-14 14:59:16,922 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2019-01-14 14:59:17,116 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2019-01-14 14:59:17,339 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 25 [2019-01-14 14:59:17,636 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 30 [2019-01-14 14:59:17,638 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 546) no Hoare annotation was computed. [2019-01-14 14:59:17,639 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 557) no Hoare annotation was computed. [2019-01-14 14:59:17,639 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 568) no Hoare annotation was computed. [2019-01-14 14:59:17,639 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 579) no Hoare annotation was computed. [2019-01-14 14:59:17,639 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 436) no Hoare annotation was computed. [2019-01-14 14:59:17,639 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 372) no Hoare annotation was computed. [2019-01-14 14:59:17,639 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 547) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse4 .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3))) [2019-01-14 14:59:17,640 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 579) the Hoare annotation is: false [2019-01-14 14:59:17,643 INFO L451 ceAbstractionStarter]: At program point L599(lines 98 600) the Hoare annotation is: true [2019-01-14 14:59:17,643 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2019-01-14 14:59:17,643 INFO L444 ceAbstractionStarter]: At program point L401(lines 392 410) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2019-01-14 14:59:17,643 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 545) no Hoare annotation was computed. [2019-01-14 14:59:17,643 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 556) no Hoare annotation was computed. [2019-01-14 14:59:17,643 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 567) no Hoare annotation was computed. [2019-01-14 14:59:17,643 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 578) no Hoare annotation was computed. [2019-01-14 14:59:17,644 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 371) no Hoare annotation was computed. [2019-01-14 14:59:17,644 INFO L448 ceAbstractionStarter]: For program point L337-1(lines 337 371) no Hoare annotation was computed. [2019-01-14 14:59:17,644 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 14:59:17,644 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 557) the Hoare annotation is: (let ((.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2019-01-14 14:59:17,644 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 568) the Hoare annotation is: (let ((.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2019-01-14 14:59:17,644 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 472) no Hoare annotation was computed. [2019-01-14 14:59:17,644 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-01-14 14:59:17,644 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 368) no Hoare annotation was computed. [2019-01-14 14:59:17,644 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 555) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 566) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 577) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 606) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 315) no Hoare annotation was computed. [2019-01-14 14:59:17,645 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 308 315) no Hoare annotation was computed. [2019-01-14 14:59:17,646 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-14 14:59:17,646 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 554) no Hoare annotation was computed. [2019-01-14 14:59:17,646 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 565) no Hoare annotation was computed. [2019-01-14 14:59:17,646 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 576) no Hoare annotation was computed. [2019-01-14 14:59:17,646 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 366) no Hoare annotation was computed. [2019-01-14 14:59:17,646 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-14 14:59:17,646 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 578) the Hoare annotation is: false [2019-01-14 14:59:17,646 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 555) the Hoare annotation is: (let ((.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2019-01-14 14:59:17,647 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 566) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse5 (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3 .cse4)) (and (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5))) [2019-01-14 14:59:17,647 INFO L451 ceAbstractionStarter]: At program point L609(lines 11 611) the Hoare annotation is: true [2019-01-14 14:59:17,647 INFO L444 ceAbstractionStarter]: At program point L543(lines 99 598) the Hoare annotation is: (let ((.cse30 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse31 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse15 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse18 (and .cse0 .cse31 .cse22)) (.cse23 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse25 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse29 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse14 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse20 (and .cse31 .cse7 .cse22)) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (and .cse31 .cse30 .cse22)) (.cse17 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse8 .cse11) (and .cse12 .cse13 .cse14 .cse10 .cse15 .cse16) (and .cse0 .cse5 .cse6 .cse17 .cse8 .cse9) (and .cse8 .cse18 .cse4) (and .cse19 .cse20) (and .cse1 .cse21) (and .cse13 .cse10 .cse11 .cse21 .cse16) (and .cse8 .cse18 .cse3 .cse17) (and (and .cse0 .cse22 .cse16) .cse4) (and .cse12 .cse14 .cse10 .cse7) (and .cse13 .cse5 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6) (and .cse0 .cse23 .cse24 .cse25 .cse17 .cse8 .cse26 .cse27 .cse28 .cse29) (and .cse8 (and .cse12 .cse13 .cse14 .cse10 .cse15)) (and .cse3 .cse20) (and (and .cse21 .cse22 .cse16) .cse4) (and .cse8 .cse19 .cse18 .cse17) (and .cse23 .cse24 .cse7 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560) .cse17) (and .cse23 .cse24 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse25 .cse30 .cse26 .cse27 .cse28 .cse29) (and .cse0 .cse10 .cse11 .cse16) (and .cse5 .cse30 .cse6 .cse8 .cse9) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse5 .cse21 .cse6 .cse16) (and .cse12 .cse14 .cse10 .cse30) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse17) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse17) (and .cse20 .cse4) (and .cse19 .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse17)))) [2019-01-14 14:59:17,647 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 446) no Hoare annotation was computed. [2019-01-14 14:59:17,647 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 553) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 564) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 575) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L346-2(lines 346 350) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 412) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 515) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 456) no Hoare annotation was computed. [2019-01-14 14:59:17,648 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-14 14:59:17,649 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-14 14:59:17,649 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 552) no Hoare annotation was computed. [2019-01-14 14:59:17,649 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 563) no Hoare annotation was computed. [2019-01-14 14:59:17,649 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-14 14:59:17,649 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 574) no Hoare annotation was computed. [2019-01-14 14:59:17,649 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 596) no Hoare annotation was computed. [2019-01-14 14:59:17,649 INFO L444 ceAbstractionStarter]: At program point L514(lines 72 610) the Hoare annotation is: false [2019-01-14 14:59:17,649 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 553) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0))) [2019-01-14 14:59:17,649 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 564) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5))) [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 595) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-01-14 14:59:17,650 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 551) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 562) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 573) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 453) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 574) the Hoare annotation is: false [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 362) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 550) no Hoare annotation was computed. [2019-01-14 14:59:17,651 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 561) no Hoare annotation was computed. [2019-01-14 14:59:17,652 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 572) no Hoare annotation was computed. [2019-01-14 14:59:17,652 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-14 14:59:17,652 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 610) no Hoare annotation was computed. [2019-01-14 14:59:17,652 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-01-14 14:59:17,652 INFO L448 ceAbstractionStarter]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2019-01-14 14:59:17,652 INFO L444 ceAbstractionStarter]: At program point L355(lines 331 373) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5))) [2019-01-14 14:59:17,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 14:59:17,652 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 551) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0) .cse1))) [2019-01-14 14:59:17,653 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 562) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2019-01-14 14:59:17,653 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 572) the Hoare annotation is: (let ((.cse1 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse7 .cse8 .cse9) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-01-14 14:59:17,653 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-14 14:59:17,653 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 424) no Hoare annotation was computed. [2019-01-14 14:59:17,653 INFO L444 ceAbstractionStarter]: At program point L389(lines 380 412) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2019-01-14 14:59:17,653 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-01-14 14:59:17,653 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L451 ceAbstractionStarter]: At program point L621(lines 612 623) the Hoare annotation is: true [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 549) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 560) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 571) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-14 14:59:17,654 INFO L448 ceAbstractionStarter]: For program point L325-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 410) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 495) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 399) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 548) no Hoare annotation was computed. [2019-01-14 14:59:17,655 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 559) no Hoare annotation was computed. [2019-01-14 14:59:17,656 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 570) no Hoare annotation was computed. [2019-01-14 14:59:17,656 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 549) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (and .cse4 .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-01-14 14:59:17,656 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 560) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3))) [2019-01-14 14:59:17,656 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-01-14 14:59:17,656 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2019-01-14 14:59:17,656 INFO L448 ceAbstractionStarter]: For program point L297-2(lines 297 301) no Hoare annotation was computed. [2019-01-14 14:59:17,656 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 547) no Hoare annotation was computed. [2019-01-14 14:59:17,656 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 558) no Hoare annotation was computed. [2019-01-14 14:59:17,656 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 569) no Hoare annotation was computed. [2019-01-14 14:59:17,657 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 598) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse31 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse15 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse18 (and .cse0 .cse31 .cse29)) (.cse30 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse19 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse25 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse14 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (and .cse31 .cse7 .cse29)) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (and .cse31 .cse21 .cse29)) (.cse17 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse8 .cse11) (and .cse12 .cse13 .cse14 .cse10 .cse15 .cse16) (and .cse0 .cse5 .cse6 .cse17 .cse8 .cse9) (and .cse8 .cse18 .cse4) (and .cse19 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse20 .cse21 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse27) (and .cse1 .cse28) (and .cse13 .cse10 .cse11 .cse28 .cse16) (and .cse8 .cse18 .cse3 .cse17) (and (and .cse0 .cse29 .cse16) .cse4) (and .cse12 .cse14 .cse10 .cse7) (and .cse13 .cse5 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6) (and .cse0 .cse30 .cse19 .cse20 .cse17 .cse8 .cse22 .cse23 .cse24 .cse25) (and .cse8 (and .cse12 .cse13 .cse14 .cse10 .cse15)) (and .cse3 .cse27) (and (and .cse28 .cse29 .cse16) .cse4) (and .cse8 .cse26 .cse18 .cse17) (and .cse30 .cse19 .cse7 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560) .cse17) (and .cse0 .cse10 .cse11 .cse16) (and .cse5 .cse21 .cse6 .cse8 .cse9) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse5 .cse28 .cse6 .cse16) (and .cse12 .cse14 .cse10 .cse21) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse17) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse17) (and .cse27 .cse4) (and .cse26 .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse17)))) [2019-01-14 14:59:17,657 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 430 438) no Hoare annotation was computed. [2019-01-14 14:59:17,657 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-14 14:59:17,657 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 558) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse4 .cse2 .cse3) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3))) [2019-01-14 14:59:17,658 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 14:59:17,658 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-14 14:59:17,658 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2019-01-14 14:59:17,658 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-01-14 14:59:17,658 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2019-01-14 14:59:17,658 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:17,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:59:17 BoogieIcfgContainer [2019-01-14 14:59:17,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:59:17,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:59:17,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:59:17,748 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:59:17,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:30" (3/4) ... [2019-01-14 14:59:17,757 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 14:59:17,784 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 14:59:17,785 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 14:59:17,957 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:59:17,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:59:17,958 INFO L168 Benchmark]: Toolchain (without parser) took 49837.06 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 951.3 MB in the beginning and 997.7 MB in the end (delta: -46.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-14 14:59:17,959 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:59:17,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.58 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:17,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:17,960 INFO L168 Benchmark]: Boogie Preprocessor took 50.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:59:17,960 INFO L168 Benchmark]: RCFGBuilder took 1332.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:17,961 INFO L168 Benchmark]: TraceAbstraction took 47589.09 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-14 14:59:17,961 INFO L168 Benchmark]: Witness Printer took 209.63 ms. Allocated memory is still 2.3 GB. Free memory was 1.0 GB in the beginning and 997.7 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:17,964 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 485.58 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 164.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1332.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47589.09 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 209.63 ms. Allocated memory is still 2.3 GB. Free memory was 1.0 GB in the beginning and 997.7 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: 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: 126]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0)) || ((((8448 <= s__state && blastFlag == 0) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((((8448 <= s__state && s__state <= 8448) && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((!(8497 == s__state) && 8466 <= s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || ((((((((((blastFlag <= 2 && 8466 <= s__state) && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && 0 == s__hit) && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((blastFlag == 1 && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || ((((blastFlag == 0 && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((!(8657 == s__state) && !(12292 == s__state)) && 8656 <= s__state) && blastFlag == 0) && !(8656 == s__state)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(12292 == s__state)) && 8656 <= s__state) && !(8656 == s__state)) && !(s__hit == 0))) || ((((!(8657 == s__state) && !(12292 == s__state)) && 8656 <= s__state) && blastFlag == 1) && !(8656 == s__state))) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(12292 == s__state)) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8656 == s__state)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && 0 == s__hit) && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((blastFlag == 0 && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((blastFlag == 1 && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608) || (blastFlag == 1 && s__state == 8608)) || (blastFlag == 0 && s__state == 8608) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && 0 == s__hit) && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((blastFlag == 1 && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || ((((blastFlag == 0 && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && 0 == s__hit) && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((blastFlag == 0 && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((blastFlag == 1 && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && 0 == s__hit) && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || (s__state <= 8576 && ((((blastFlag == 1 && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state))) || ((((((blastFlag == 0 && 8512 <= s__state) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) || ((8576 <= s__state && blastFlag == 0) && s__state <= 8640)) || ((8576 <= s__state && blastFlag == 1) && s__state <= 8640) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((blastFlag <= 2 && s__state <= 3) || (((8576 <= s__state && blastFlag == 0) && s__state <= 8640) && s__state == 8608)) || (((8576 <= s__state && blastFlag == 0) && s__state <= 8640) && 8640 <= s__state)) || ((((8448 <= s__state && s__state <= 8448) && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656)) || (((((s__state <= 8672 && blastFlag <= 3) && !(8657 == s__state)) && 8656 <= s__state) && !(8656 == s__state)) && !(s__hit == 0))) || (((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 8576 && (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && 8640 <= s__state)) || (s__state == 8592 && (8576 <= s__state && blastFlag == 1) && s__state <= 8640)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && s__state == 8608) && 0 == s__hit)) || (((blastFlag <= 2 && s__state <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((s__state <= 8672 && !(8657 == s__state)) && 8656 <= s__state) && blastFlag == 1)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((((((((blastFlag <= 2 && 8466 <= s__state) && !(8497 == s__state)) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && blastFlag <= 3) && !(8657 == s__state)) && 8656 <= s__state) && !(8656 == s__state))) || (s__state == 8608 && (8576 <= s__state && blastFlag == 1) && s__state <= 8640)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((((((8466 <= s__state && !(8497 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((blastFlag <= 2 && s__state == 8560) && 0 == s__hit)) || ((((((((8466 <= s__state && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(s__hit == 0))) || ((((8448 <= s__state && blastFlag == 0) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (((s__state <= 8672 && !(8657 == s__state)) && 8656 <= s__state) && blastFlag == 0)) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || (((8576 <= s__state && blastFlag == 1) && s__state <= 8640) && 8640 <= s__state)) || (s__state == 8592 && (8576 <= s__state && blastFlag == 0) && s__state <= 8640)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && 8466 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || ((((((((8466 <= s__state && !(8481 == s__state)) && blastFlag == 1) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((blastFlag <= 2 && s__state <= 3) || (((8576 <= s__state && blastFlag == 0) && s__state <= 8640) && s__state == 8608)) || (((8576 <= s__state && blastFlag == 0) && s__state <= 8640) && 8640 <= s__state)) || ((((8448 <= s__state && s__state <= 8448) && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656)) || (((((s__state <= 8672 && blastFlag <= 3) && !(8657 == s__state)) && 8656 <= s__state) && !(8656 == s__state)) && !(s__hit == 0))) || (((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 8576 && (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && 8640 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (s__state == 8592 && (8576 <= s__state && blastFlag == 1) && s__state <= 8640)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && s__state == 8608) && 0 == s__hit)) || (((blastFlag <= 2 && s__state <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((s__state <= 8672 && !(8657 == s__state)) && 8656 <= s__state) && blastFlag == 1)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((((((((blastFlag <= 2 && 8466 <= s__state) && !(8497 == s__state)) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && blastFlag <= 3) && !(8657 == s__state)) && 8656 <= s__state) && !(8656 == s__state))) || (s__state == 8608 && (8576 <= s__state && blastFlag == 1) && s__state <= 8640)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((((((8466 <= s__state && !(8497 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((blastFlag <= 2 && s__state == 8560) && 0 == s__hit)) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(s__hit == 0))) || ((((8448 <= s__state && blastFlag == 0) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (((s__state <= 8672 && !(8657 == s__state)) && 8656 <= s__state) && blastFlag == 0)) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || (((8576 <= s__state && blastFlag == 1) && s__state <= 8640) && 8640 <= s__state)) || (s__state == 8592 && (8576 <= s__state && blastFlag == 0) && s__state <= 8640)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) || ((8576 <= s__state && blastFlag == 0) && s__state <= 8640)) || ((8576 <= s__state && blastFlag == 1) && s__state <= 8640) - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && 0 == s__hit) && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((blastFlag == 1 && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || ((((blastFlag == 0 && 8512 <= s__state) && !(8561 == s__state)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((blastFlag == 0 && 8512 <= s__state) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8576) || (((((blastFlag <= 2 && 8512 <= s__state) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8576) && 0 == s__hit)) || ((((blastFlag == 1 && 8512 <= s__state) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && blastFlag <= 3) && 8656 <= s__state) && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) || (((s__state <= 8672 && 8656 <= s__state) && !(8672 == s__state)) && blastFlag == 0)) || ((((blastFlag <= 2 && s__state <= 8672) && 8656 <= s__state) && !(8672 == s__state)) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__state <= 8672) && 8656 <= s__state) && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8672 && 8656 <= s__state) && blastFlag == 1) && !(8672 == s__state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. SAFE Result, 47.4s OverallTime, 36 OverallIterations, 24 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 15.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 6853 SDtfs, 5000 SDslu, 3910 SDs, 0 SdLazy, 4716 SolverSat, 1140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2056 GetRequests, 1998 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5019occurred in iteration=27, 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: 2.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 8718 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 252 NumberOfFragments, 2285 HoareAnnotationTreeSize, 28 FomulaSimplifications, 145325 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 28 FomulaSimplificationsInter, 45768 FormulaSimplificationTreeSizeReductionInter, 12.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 9430 NumberOfCodeBlocks, 9430 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 9389 ConstructedInterpolants, 0 QuantifiedInterpolants, 4243107 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3091 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 36027/36132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...