./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_12_false-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_12_false-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 944a0f8e72be5c35a0f511b0309102d972799eb1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:57:21,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:57:21,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:57:21,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:57:21,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:57:21,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:57:21,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:57:21,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:57:21,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:57:21,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:57:21,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:57:21,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:57:21,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:57:21,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:57:21,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:57:21,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:57:21,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:57:21,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:57:21,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:57:21,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:57:21,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:57:21,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:57:21,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:57:21,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:57:21,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:57:21,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:57:21,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:57:21,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:57:21,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:57:21,257 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:57:21,258 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:57:21,259 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:57:21,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:57:21,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:57:21,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:57:21,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:57:21,265 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:57:21,291 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:57:21,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:57:21,294 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:57:21,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:57:21,295 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:57:21,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:57:21,296 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:57:21,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:57:21,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:57:21,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:57:21,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:57:21,298 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:57:21,298 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:57:21,298 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:57:21,298 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:57:21,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:57:21,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:57:21,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:57:21,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:57:21,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:57:21,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:21,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:57:21,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:57:21,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:57:21,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:57:21,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:57:21,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:57:21,304 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 -> 944a0f8e72be5c35a0f511b0309102d972799eb1 [2019-01-14 14:57:21,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:57:21,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:57:21,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:57:21,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:57:21,394 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:57:21,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_12_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:21,453 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e412aa7/839d3af070b440bc96921062742459f4/FLAG5ada46773 [2019-01-14 14:57:21,915 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:57:21,916 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_12_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:21,935 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e412aa7/839d3af070b440bc96921062742459f4/FLAG5ada46773 [2019-01-14 14:57:22,211 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e412aa7/839d3af070b440bc96921062742459f4 [2019-01-14 14:57:22,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:57:22,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:57:22,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:22,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:57:22,220 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:57:22,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9c8e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22, skipping insertion in model container [2019-01-14 14:57:22,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:57:22,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:57:22,623 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:22,628 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:57:22,692 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:22,707 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:57:22,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22 WrapperNode [2019-01-14 14:57:22,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:22,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:22,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:57:22,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:57:22,722 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:57:22" (1/1) ... [2019-01-14 14:57:22,740 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:57:22" (1/1) ... [2019-01-14 14:57:22,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:22,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:57:22,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:57:22,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:57:22,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (1/1) ... [2019-01-14 14:57:22,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:57:22,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:57:22,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:57:22,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:57:22,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (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:57:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:57:22,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:57:23,106 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:57:24,426 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-14 14:57:24,426 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-14 14:57:24,427 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:57:24,427 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:57:24,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:24 BoogieIcfgContainer [2019-01-14 14:57:24,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:57:24,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:57:24,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:57:24,433 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:57:24,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:57:22" (1/3) ... [2019-01-14 14:57:24,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359d72ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:24, skipping insertion in model container [2019-01-14 14:57:24,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:22" (2/3) ... [2019-01-14 14:57:24,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359d72ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:24, skipping insertion in model container [2019-01-14 14:57:24,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:24" (3/3) ... [2019-01-14 14:57:24,437 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_12_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:24,445 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:57:24,452 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:57:24,466 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:57:24,499 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:57:24,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:57:24,500 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:57:24,500 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:57:24,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:57:24,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:57:24,501 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:57:24,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:57:24,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:57:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-01-14 14:57:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:57:24,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:24,530 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] [2019-01-14 14:57:24,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:24,539 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-01-14 14:57:24,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:24,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:24,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:24,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:24,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:24,762 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:57:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:24,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:24,780 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-01-14 14:57:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:25,533 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-01-14 14:57:25,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:25,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:57:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:25,549 INFO L225 Difference]: With dead ends: 352 [2019-01-14 14:57:25,549 INFO L226 Difference]: Without dead ends: 173 [2019-01-14 14:57:25,556 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:57:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-14 14:57:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-14 14:57:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-14 14:57:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-01-14 14:57:25,620 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-01-14 14:57:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:25,621 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-01-14 14:57:25,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-01-14 14:57:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:57:25,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:25,623 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] [2019-01-14 14:57:25,624 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:25,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:25,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-01-14 14:57:25,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:25,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:25,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:25,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:25,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:25,710 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:57:25,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:25,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:25,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:25,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:25,715 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-01-14 14:57:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:25,989 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-01-14 14:57:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:25,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:57:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:25,993 INFO L225 Difference]: With dead ends: 357 [2019-01-14 14:57:25,993 INFO L226 Difference]: Without dead ends: 193 [2019-01-14 14:57:25,995 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:57:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-14 14:57:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-14 14:57:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-14 14:57:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-01-14 14:57:26,019 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-01-14 14:57:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:26,023 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-01-14 14:57:26,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-01-14 14:57:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:57:26,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:26,025 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] [2019-01-14 14:57:26,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-01-14 14:57:26,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:26,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:26,125 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:57:26,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:26,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:26,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:26,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:26,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:26,128 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-01-14 14:57:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:26,421 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-01-14 14:57:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:26,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:57:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:26,425 INFO L225 Difference]: With dead ends: 387 [2019-01-14 14:57:26,425 INFO L226 Difference]: Without dead ends: 201 [2019-01-14 14:57:26,426 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:57:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-14 14:57:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-14 14:57:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-14 14:57:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-01-14 14:57:26,443 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-01-14 14:57:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:26,444 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-01-14 14:57:26,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-01-14 14:57:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:57:26,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:26,446 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] [2019-01-14 14:57:26,446 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-01-14 14:57:26,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:26,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:26,538 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:57:26,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:26,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:26,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:26,540 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-01-14 14:57:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:26,954 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-01-14 14:57:26,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:26,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:57:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:26,959 INFO L225 Difference]: With dead ends: 392 [2019-01-14 14:57:26,959 INFO L226 Difference]: Without dead ends: 200 [2019-01-14 14:57:26,960 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:57:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-14 14:57:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-01-14 14:57:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-14 14:57:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-01-14 14:57:26,992 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-01-14 14:57:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:26,993 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-01-14 14:57:26,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-01-14 14:57:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:57:26,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:26,995 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] [2019-01-14 14:57:26,995 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-01-14 14:57:26,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:26,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:26,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:27,079 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:57:27,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:27,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:27,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:27,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:27,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:27,082 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-01-14 14:57:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:27,357 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-01-14 14:57:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:27,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 14:57:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:27,359 INFO L225 Difference]: With dead ends: 403 [2019-01-14 14:57:27,359 INFO L226 Difference]: Without dead ends: 210 [2019-01-14 14:57:27,360 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:57:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-14 14:57:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-01-14 14:57:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-14 14:57:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-01-14 14:57:27,384 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-01-14 14:57:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:27,384 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-01-14 14:57:27,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-01-14 14:57:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 14:57:27,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:27,386 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] [2019-01-14 14:57:27,386 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-01-14 14:57:27,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:27,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:27,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:27,460 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:57:27,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:27,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:27,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:27,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:27,463 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-01-14 14:57:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:27,787 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-01-14 14:57:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:27,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 14:57:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:27,790 INFO L225 Difference]: With dead ends: 403 [2019-01-14 14:57:27,790 INFO L226 Difference]: Without dead ends: 210 [2019-01-14 14:57:27,790 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:57:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-14 14:57:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-01-14 14:57:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-14 14:57:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-01-14 14:57:27,799 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-01-14 14:57:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:27,799 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-01-14 14:57:27,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-01-14 14:57:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 14:57:27,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:27,801 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] [2019-01-14 14:57:27,801 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-01-14 14:57:27,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:27,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:27,838 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:57:27,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:27,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:27,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:27,839 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-01-14 14:57:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:28,006 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-01-14 14:57:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:28,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 14:57:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,010 INFO L225 Difference]: With dead ends: 403 [2019-01-14 14:57:28,010 INFO L226 Difference]: Without dead ends: 210 [2019-01-14 14:57:28,011 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:57:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-14 14:57:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-01-14 14:57:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-14 14:57:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-01-14 14:57:28,021 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-01-14 14:57:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,022 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-01-14 14:57:28,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-01-14 14:57:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 14:57:28,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,023 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] [2019-01-14 14:57:28,024 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-01-14 14:57:28,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:28,094 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:57:28,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:28,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:28,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:57:28,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:57:28,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:57:28,097 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-01-14 14:57:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:28,646 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-01-14 14:57:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:57:28,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-14 14:57:28,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,652 INFO L225 Difference]: With dead ends: 599 [2019-01-14 14:57:28,652 INFO L226 Difference]: Without dead ends: 406 [2019-01-14 14:57:28,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:57:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-14 14:57:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-01-14 14:57:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-14 14:57:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-01-14 14:57:28,681 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-01-14 14:57:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,685 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-01-14 14:57:28,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:57:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-01-14 14:57:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 14:57:28,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,687 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:57:28,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-01-14 14:57:28,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:28,804 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:57:28,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:28,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:28,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:28,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:28,806 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-01-14 14:57:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:29,775 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-01-14 14:57:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:29,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-14 14:57:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:29,781 INFO L225 Difference]: With dead ends: 841 [2019-01-14 14:57:29,781 INFO L226 Difference]: Without dead ends: 466 [2019-01-14 14:57:29,783 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:57:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-01-14 14:57:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-01-14 14:57:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-14 14:57:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-01-14 14:57:29,808 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-01-14 14:57:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:29,812 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-01-14 14:57:29,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-01-14 14:57:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 14:57:29,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:29,815 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:57:29,815 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-01-14 14:57:29,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:29,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:29,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:29,919 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:57:29,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:29,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:29,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:29,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:29,920 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-01-14 14:57:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:31,160 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-01-14 14:57:31,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:31,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-14 14:57:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:31,164 INFO L225 Difference]: With dead ends: 930 [2019-01-14 14:57:31,164 INFO L226 Difference]: Without dead ends: 489 [2019-01-14 14:57:31,166 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:57:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-01-14 14:57:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-01-14 14:57:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-01-14 14:57:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-01-14 14:57:31,190 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-01-14 14:57:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:31,191 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-01-14 14:57:31,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-01-14 14:57:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 14:57:31,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:31,192 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 14:57:31,193 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:31,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:31,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-01-14 14:57:31,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 14:57:31,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:31,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:31,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:31,289 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-01-14 14:57:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:31,721 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-01-14 14:57:31,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:31,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-14 14:57:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:31,724 INFO L225 Difference]: With dead ends: 987 [2019-01-14 14:57:31,724 INFO L226 Difference]: Without dead ends: 523 [2019-01-14 14:57:31,725 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:57:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-01-14 14:57:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-01-14 14:57:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-14 14:57:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-01-14 14:57:31,744 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-01-14 14:57:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:31,744 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-01-14 14:57:31,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-01-14 14:57:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 14:57:31,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:31,747 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 14:57:31,747 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-01-14 14:57:31,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:31,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 14:57:31,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:31,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:31,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:31,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:31,838 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-01-14 14:57:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:32,260 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-01-14 14:57:32,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:32,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-01-14 14:57:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:32,263 INFO L225 Difference]: With dead ends: 1021 [2019-01-14 14:57:32,263 INFO L226 Difference]: Without dead ends: 523 [2019-01-14 14:57:32,265 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:57:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-01-14 14:57:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-01-14 14:57:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-14 14:57:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-01-14 14:57:32,284 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-01-14 14:57:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:32,284 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-01-14 14:57:32,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-01-14 14:57:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 14:57:32,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:32,285 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 14:57:32,286 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:32,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-01-14 14:57:32,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 14:57:32,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:32,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:32,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:32,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:32,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:32,336 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-01-14 14:57:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:33,093 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-01-14 14:57:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:33,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-01-14 14:57:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:33,100 INFO L225 Difference]: With dead ends: 1068 [2019-01-14 14:57:33,100 INFO L226 Difference]: Without dead ends: 570 [2019-01-14 14:57:33,102 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:57:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-01-14 14:57:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-01-14 14:57:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-01-14 14:57:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-01-14 14:57:33,122 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-01-14 14:57:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:33,123 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-01-14 14:57:33,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-01-14 14:57:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 14:57:33,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:33,124 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, 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:57:33,126 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-01-14 14:57:33,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:33,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:33,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:33,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:33,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:33,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:33,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:33,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:33,221 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-01-14 14:57:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:33,944 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-01-14 14:57:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:33,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-01-14 14:57:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:33,948 INFO L225 Difference]: With dead ends: 1178 [2019-01-14 14:57:33,948 INFO L226 Difference]: Without dead ends: 617 [2019-01-14 14:57:33,949 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:57:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-01-14 14:57:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-01-14 14:57:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-01-14 14:57:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-01-14 14:57:33,969 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-01-14 14:57:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:33,970 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-01-14 14:57:33,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-01-14 14:57:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 14:57:33,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:33,971 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, 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:57:33,972 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-01-14 14:57:33,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:33,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:33,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:33,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:34,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:34,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:34,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:34,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:34,056 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-01-14 14:57:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:34,366 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-01-14 14:57:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:34,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-01-14 14:57:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:34,370 INFO L225 Difference]: With dead ends: 1221 [2019-01-14 14:57:34,370 INFO L226 Difference]: Without dead ends: 617 [2019-01-14 14:57:34,371 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:57:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-01-14 14:57:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-01-14 14:57:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-01-14 14:57:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-01-14 14:57:34,396 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-01-14 14:57:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:34,397 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-01-14 14:57:34,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-01-14 14:57:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:57:34,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:34,399 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:57:34,399 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-01-14 14:57:34,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 14:57:34,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:34,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:34,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:34,478 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-01-14 14:57:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:34,689 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-01-14 14:57:34,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:34,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:57:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:34,694 INFO L225 Difference]: With dead ends: 1217 [2019-01-14 14:57:34,694 INFO L226 Difference]: Without dead ends: 613 [2019-01-14 14:57:34,695 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:57:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-01-14 14:57:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-01-14 14:57:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-01-14 14:57:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-01-14 14:57:34,715 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-01-14 14:57:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:34,715 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-01-14 14:57:34,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-01-14 14:57:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 14:57:34,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:34,717 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-01-14 14:57:34,717 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:34,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-01-14 14:57:34,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:34,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:34,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 14:57:34,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:34,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:34,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:34,786 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-01-14 14:57:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:34,941 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-01-14 14:57:34,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:34,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-01-14 14:57:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:34,946 INFO L225 Difference]: With dead ends: 1275 [2019-01-14 14:57:34,946 INFO L226 Difference]: Without dead ends: 671 [2019-01-14 14:57:34,947 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:57:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-01-14 14:57:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-01-14 14:57:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-01-14 14:57:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-01-14 14:57:34,967 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-01-14 14:57:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:34,968 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-01-14 14:57:34,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-01-14 14:57:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 14:57:34,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:34,970 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, 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:57:34,970 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:34,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-01-14 14:57:34,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:34,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 14:57:35,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:35,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:35,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:35,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:35,047 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-01-14 14:57:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:35,338 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-01-14 14:57:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:35,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-14 14:57:35,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:35,343 INFO L225 Difference]: With dead ends: 1307 [2019-01-14 14:57:35,343 INFO L226 Difference]: Without dead ends: 671 [2019-01-14 14:57:35,344 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:57:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-01-14 14:57:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-01-14 14:57:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-01-14 14:57:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-01-14 14:57:35,364 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-01-14 14:57:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:35,365 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-01-14 14:57:35,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-01-14 14:57:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 14:57:35,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:35,367 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, 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:57:35,367 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-01-14 14:57:35,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:35,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:35,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:35,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:35,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 14:57:35,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:35,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:35,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:35,445 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-01-14 14:57:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:35,947 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-01-14 14:57:35,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:35,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-14 14:57:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:35,952 INFO L225 Difference]: With dead ends: 1343 [2019-01-14 14:57:35,953 INFO L226 Difference]: Without dead ends: 707 [2019-01-14 14:57:35,954 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:57:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-01-14 14:57:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-01-14 14:57:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-01-14 14:57:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-01-14 14:57:35,975 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-01-14 14:57:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:35,976 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-01-14 14:57:35,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-01-14 14:57:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 14:57:35,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:35,978 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, 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] [2019-01-14 14:57:35,978 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-01-14 14:57:35,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:35,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:35,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 14:57:36,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:36,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:36,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:36,048 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-01-14 14:57:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:36,265 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-01-14 14:57:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:36,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-14 14:57:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:36,270 INFO L225 Difference]: With dead ends: 1400 [2019-01-14 14:57:36,270 INFO L226 Difference]: Without dead ends: 708 [2019-01-14 14:57:36,271 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:57:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-01-14 14:57:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-01-14 14:57:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-01-14 14:57:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-01-14 14:57:36,292 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-01-14 14:57:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:36,292 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-01-14 14:57:36,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-01-14 14:57:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-14 14:57:36,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:36,294 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, 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] [2019-01-14 14:57:36,294 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:36,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:36,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-01-14 14:57:36,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:36,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:36,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-14 14:57:36,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:36,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:36,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:36,369 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-01-14 14:57:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:36,704 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-01-14 14:57:36,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:36,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-01-14 14:57:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:36,709 INFO L225 Difference]: With dead ends: 1432 [2019-01-14 14:57:36,709 INFO L226 Difference]: Without dead ends: 743 [2019-01-14 14:57:36,710 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:57:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-01-14 14:57:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-01-14 14:57:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-01-14 14:57:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-01-14 14:57:36,734 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-01-14 14:57:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:36,734 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-01-14 14:57:36,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-01-14 14:57:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 14:57:36,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:36,738 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, 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] [2019-01-14 14:57:36,738 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-01-14 14:57:36,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:36,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-14 14:57:36,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:36,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:36,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:36,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:36,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:36,807 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-01-14 14:57:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:36,971 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-01-14 14:57:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:36,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-01-14 14:57:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:36,975 INFO L225 Difference]: With dead ends: 1473 [2019-01-14 14:57:36,975 INFO L226 Difference]: Without dead ends: 743 [2019-01-14 14:57:36,977 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:57:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-01-14 14:57:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-01-14 14:57:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-01-14 14:57:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-01-14 14:57:36,998 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-01-14 14:57:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:36,998 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-01-14 14:57:36,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-01-14 14:57:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-14 14:57:37,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:37,000 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:37,001 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-01-14 14:57:37,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-01-14 14:57:37,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:37,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:37,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:37,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:37,084 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-01-14 14:57:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:37,911 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-01-14 14:57:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:37,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-01-14 14:57:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:37,915 INFO L225 Difference]: With dead ends: 1509 [2019-01-14 14:57:37,915 INFO L226 Difference]: Without dead ends: 779 [2019-01-14 14:57:37,916 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:57:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-01-14 14:57:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-01-14 14:57:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-01-14 14:57:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-01-14 14:57:37,946 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-01-14 14:57:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:37,946 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-01-14 14:57:37,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-01-14 14:57:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 14:57:37,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:37,948 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:37,949 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-01-14 14:57:37,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:37,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:37,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:37,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-01-14 14:57:38,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:38,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:38,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:38,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:38,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:38,028 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-01-14 14:57:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:38,221 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-01-14 14:57:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-01-14 14:57:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:38,225 INFO L225 Difference]: With dead ends: 1541 [2019-01-14 14:57:38,225 INFO L226 Difference]: Without dead ends: 779 [2019-01-14 14:57:38,226 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:57:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-01-14 14:57:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-01-14 14:57:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-01-14 14:57:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-01-14 14:57:38,247 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-01-14 14:57:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:38,247 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-01-14 14:57:38,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-01-14 14:57:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-14 14:57:38,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:38,252 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:38,252 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-01-14 14:57:38,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-14 14:57:38,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:38,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:38,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:38,336 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-01-14 14:57:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:38,611 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-01-14 14:57:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:38,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-01-14 14:57:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:38,617 INFO L225 Difference]: With dead ends: 1567 [2019-01-14 14:57:38,617 INFO L226 Difference]: Without dead ends: 805 [2019-01-14 14:57:38,618 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:57:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-01-14 14:57:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-01-14 14:57:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-01-14 14:57:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-01-14 14:57:38,641 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-01-14 14:57:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:38,641 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-01-14 14:57:38,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-01-14 14:57:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-14 14:57:38,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:38,646 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:38,646 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-01-14 14:57:38,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:38,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:38,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:38,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-14 14:57:38,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:38,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:38,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:38,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:38,717 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-01-14 14:57:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:38,904 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-01-14 14:57:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:38,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-01-14 14:57:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:38,909 INFO L225 Difference]: With dead ends: 1595 [2019-01-14 14:57:38,910 INFO L226 Difference]: Without dead ends: 805 [2019-01-14 14:57:38,911 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:57:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-01-14 14:57:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-01-14 14:57:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-01-14 14:57:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-01-14 14:57:38,928 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-01-14 14:57:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:38,928 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-01-14 14:57:38,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-01-14 14:57:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-14 14:57:38,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:38,931 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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:57:38,931 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-01-14 14:57:38,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:38,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-14 14:57:39,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:39,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:39,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:39,008 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-01-14 14:57:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:39,765 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-01-14 14:57:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:39,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-01-14 14:57:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:39,770 INFO L225 Difference]: With dead ends: 1650 [2019-01-14 14:57:39,770 INFO L226 Difference]: Without dead ends: 860 [2019-01-14 14:57:39,771 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:57:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-01-14 14:57:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-01-14 14:57:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-01-14 14:57:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-01-14 14:57:39,790 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-01-14 14:57:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:39,790 INFO L480 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-01-14 14:57:39,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-01-14 14:57:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-14 14:57:39,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:39,792 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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:57:39,792 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-01-14 14:57:39,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:39,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:39,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-14 14:57:39,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:39,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:39,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:39,883 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-01-14 14:57:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:40,192 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-01-14 14:57:40,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:40,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-01-14 14:57:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:40,199 INFO L225 Difference]: With dead ends: 1699 [2019-01-14 14:57:40,199 INFO L226 Difference]: Without dead ends: 844 [2019-01-14 14:57:40,200 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:57:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-01-14 14:57:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-01-14 14:57:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-01-14 14:57:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-01-14 14:57:40,223 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-01-14 14:57:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:40,223 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-01-14 14:57:40,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-01-14 14:57:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-14 14:57:40,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:40,227 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:40,227 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-01-14 14:57:40,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:40,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:40,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-01-14 14:57:40,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:40,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:40,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:40,310 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-01-14 14:57:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:40,551 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-01-14 14:57:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:40,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-01-14 14:57:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:40,555 INFO L225 Difference]: With dead ends: 1665 [2019-01-14 14:57:40,555 INFO L226 Difference]: Without dead ends: 842 [2019-01-14 14:57:40,556 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:57:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-14 14:57:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-01-14 14:57:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-01-14 14:57:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-01-14 14:57:40,598 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-01-14 14:57:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:40,599 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-01-14 14:57:40,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-01-14 14:57:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-14 14:57:40,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:40,602 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:40,602 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:40,604 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-01-14 14:57:40,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:40,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:40,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-01-14 14:57:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:40,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:40,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:40,691 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-01-14 14:57:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:41,451 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-01-14 14:57:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:41,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-01-14 14:57:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:41,455 INFO L225 Difference]: With dead ends: 1665 [2019-01-14 14:57:41,455 INFO L226 Difference]: Without dead ends: 825 [2019-01-14 14:57:41,456 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:57:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-01-14 14:57:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-01-14 14:57:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-14 14:57:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-01-14 14:57:41,479 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-01-14 14:57:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:41,479 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-01-14 14:57:41,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-01-14 14:57:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-14 14:57:41,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:41,481 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:41,481 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:41,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-01-14 14:57:41,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:41,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-01-14 14:57:41,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:41,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:41,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:41,567 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-01-14 14:57:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:41,703 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-01-14 14:57:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:41,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-01-14 14:57:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:41,712 INFO L225 Difference]: With dead ends: 2411 [2019-01-14 14:57:41,712 INFO L226 Difference]: Without dead ends: 1605 [2019-01-14 14:57:41,714 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:57:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-01-14 14:57:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-01-14 14:57:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-01-14 14:57:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-01-14 14:57:41,750 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-01-14 14:57:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:41,750 INFO L480 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-01-14 14:57:41,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-01-14 14:57:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-14 14:57:41,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:41,754 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:41,754 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-01-14 14:57:41,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:41,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:41,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:41,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:41,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-14 14:57:41,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:41,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:41,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:41,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:41,845 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-01-14 14:57:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:41,954 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-01-14 14:57:41,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:41,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-01-14 14:57:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:41,963 INFO L225 Difference]: With dead ends: 2410 [2019-01-14 14:57:41,963 INFO L226 Difference]: Without dead ends: 1602 [2019-01-14 14:57:41,965 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:57:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-01-14 14:57:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-01-14 14:57:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-01-14 14:57:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-01-14 14:57:42,016 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-01-14 14:57:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:42,016 INFO L480 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-01-14 14:57:42,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-01-14 14:57:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-14 14:57:42,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:42,018 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:42,018 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-01-14 14:57:42,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:42,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:42,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:42,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:42,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:42,228 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-14 14:57:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-01-14 14:57:42,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:42,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:42,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:42,244 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-01-14 14:57:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:42,438 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-01-14 14:57:42,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:42,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-01-14 14:57:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:42,453 INFO L225 Difference]: With dead ends: 4746 [2019-01-14 14:57:42,454 INFO L226 Difference]: Without dead ends: 3153 [2019-01-14 14:57:42,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-01-14 14:57:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-01-14 14:57:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-01-14 14:57:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-01-14 14:57:42,550 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-01-14 14:57:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:42,550 INFO L480 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-01-14 14:57:42,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-01-14 14:57:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-14 14:57:42,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:42,554 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:42,555 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-01-14 14:57:42,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-14 14:57:42,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:42,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:42,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:42,651 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-01-14 14:57:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:43,437 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-01-14 14:57:43,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:43,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-01-14 14:57:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:43,454 INFO L225 Difference]: With dead ends: 4786 [2019-01-14 14:57:43,454 INFO L226 Difference]: Without dead ends: 3193 [2019-01-14 14:57:43,458 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:57:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-01-14 14:57:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-01-14 14:57:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-01-14 14:57:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-01-14 14:57:43,733 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-01-14 14:57:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:43,734 INFO L480 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-01-14 14:57:43,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-01-14 14:57:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-14 14:57:43,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:43,742 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:43,742 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-01-14 14:57:43,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:43,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:43,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:43,940 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 14:57:44,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:57:44 BoogieIcfgContainer [2019-01-14 14:57:44,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:57:44,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:57:44,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:57:44,063 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:57:44,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:24" (3/4) ... [2019-01-14 14:57:44,068 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 14:57:44,244 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:57:44,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:57:44,245 INFO L168 Benchmark]: Toolchain (without parser) took 22030.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -271.0 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:44,247 INFO L168 Benchmark]: CDTParser took 0.17 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:57:44,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:44,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:44,250 INFO L168 Benchmark]: Boogie Preprocessor took 49.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:44,250 INFO L168 Benchmark]: RCFGBuilder took 1525.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.6 MB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:44,250 INFO L168 Benchmark]: TraceAbstraction took 19632.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 245.9 MB). Free memory was 985.6 MB in the beginning and 1.2 GB in the end (delta: -248.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:44,251 INFO L168 Benchmark]: Witness Printer took 181.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:44,257 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.17 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 492.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1525.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.6 MB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19632.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 245.9 MB). Free memory was 985.6 MB in the beginning and 1.2 GB in the end (delta: -248.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 181.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 698]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L703] int s ; [L704] int tmp ; [L708] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L75] s__state = initial_state [L76] blastFlag = 0 [L77] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 + 12288) [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L291] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 8512 [L299] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND TRUE s__state == 8512 [L304] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L305] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L306] COND TRUE __cil_tmp56 + 256UL [L307] __cil_tmp56 = 256345 [L308] skip = 1 [L319] s__state = 8528 [L320] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND TRUE s__state == 8528 [L324] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L325] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L327] __cil_tmp57 = (unsigned long )s__options [L328] COND TRUE __cil_tmp57 + 2097152UL [L329] s__s3__tmp__use_rsa_tmp = 1 [L334] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L362] ret = __VERIFIER_nondet_int() [L363] COND FALSE !(blastFlag == 3) [L366] COND FALSE !(ret <= 0) [L383] s__state = 8544 [L384] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND TRUE s__state == 8544 [L388] COND TRUE s__verify_mode + 1 [L389] COND TRUE s__session__peer != 0 [L390] COND TRUE s__verify_mode + 4 [L391] s__verify_mode = 123 [L392] skip = 1 [L393] s__s3__tmp__cert_request = 0 [L394] s__state = 8560 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND TRUE s__state == 8560 [L438] ret = __VERIFIER_nondet_int() [L439] COND FALSE !(ret <= 0) [L442] s__s3__tmp__next_state___0 = 8576 [L443] s__state = 8448 [L444] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND TRUE ! s__s3__tmp__reuse_message [L654] COND TRUE ! skip [L655] COND TRUE state == 8560 [L656] COND TRUE s__state == 8448 [L657] COND TRUE s__verify_mode != -1 [L658] COND TRUE s__verify_mode != -2 [L659] COND TRUE __cil_tmp61 != 9021 [L660] COND TRUE __cil_tmp58 != 4294967294 [L661] COND TRUE blastFlag != 4 [L662] COND TRUE tmp___7 != 1024 [L698] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. UNSAFE Result, 19.5s OverallTime, 35 OverallIterations, 6 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, 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: 1.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...