./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_14_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_14_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 8b245293effe524631a7c3459bf277cf6c81eafa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11 21:22:50,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:22:50,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:22:50,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:22:50,459 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:22:50,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:22:50,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:22:50,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:22:50,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:22:50,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:22:50,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:22:50,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:22:50,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:22:50,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:22:50,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:22:50,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:22:50,486 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:22:50,491 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:22:50,495 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:22:50,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:22:50,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:22:50,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:22:50,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:22:50,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:22:50,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:22:50,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:22:50,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:22:50,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:22:50,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:22:50,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:22:50,520 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:22:50,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:22:50,521 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:22:50,521 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:22:50,522 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:22:50,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:22:50,523 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:22:50,551 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:22:50,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:22:50,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:22:50,555 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:22:50,555 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:22:50,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:22:50,555 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:22:50,556 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:22:50,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:22:50,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:22:50,557 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:22:50,557 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:22:50,557 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:22:50,557 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:22:50,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:22:50,558 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:22:50,558 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:22:50,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:22:50,558 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:22:50,558 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:22:50,558 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:22:50,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:22:50,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:22:50,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:22:50,560 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:22:50,561 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:22:50,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:22:50,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:22:50,563 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 -> 8b245293effe524631a7c3459bf277cf6c81eafa [2019-01-11 21:22:50,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:22:50,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:22:50,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:22:50,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:22:50,634 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:22:50,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_14_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:50,691 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d3ad31d/ea3cfd2553ce4c51afb99c1e36b3ecdc/FLAGb4adf1eb9 [2019-01-11 21:22:51,174 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:22:51,175 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_14_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:51,192 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d3ad31d/ea3cfd2553ce4c51afb99c1e36b3ecdc/FLAGb4adf1eb9 [2019-01-11 21:22:51,497 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d3ad31d/ea3cfd2553ce4c51afb99c1e36b3ecdc [2019-01-11 21:22:51,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:22:51,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:22:51,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:51,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:22:51,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:22:51,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:51,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@869a0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51, skipping insertion in model container [2019-01-11 21:22:51,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:51,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:22:51,568 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:22:51,806 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:51,813 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:22:51,871 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:51,889 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:22:51,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51 WrapperNode [2019-01-11 21:22:51,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:51,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:51,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:22:51,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:22:51,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:51,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:52,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:22:52,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:22:52,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:22:52,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (1/1) ... [2019-01-11 21:22:52,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:22:52,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:22:52,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:22:52,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:22:52,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (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-11 21:22:52,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:22:52,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:22:52,302 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:22:53,504 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:22:53,504 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:22:53,506 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:22:53,506 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:22:53,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:53 BoogieIcfgContainer [2019-01-11 21:22:53,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:22:53,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:22:53,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:22:53,511 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:22:53,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:22:51" (1/3) ... [2019-01-11 21:22:53,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5569626f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:53, skipping insertion in model container [2019-01-11 21:22:53,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:51" (2/3) ... [2019-01-11 21:22:53,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5569626f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:53, skipping insertion in model container [2019-01-11 21:22:53,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:53" (3/3) ... [2019-01-11 21:22:53,515 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_14_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:53,524 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:22:53,533 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:22:53,549 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:22:53,587 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:22:53,587 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:22:53,588 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:22:53,588 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:22:53,588 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:22:53,588 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:22:53,588 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:22:53,589 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:22:53,589 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:22:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-01-11 21:22:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 21:22:53,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:53,617 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] [2019-01-11 21:22:53,620 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:53,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:53,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2019-01-11 21:22:53,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:53,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:53,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:53,841 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-11 21:22:53,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:53,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:53,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:53,867 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-01-11 21:22:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:54,797 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2019-01-11 21:22:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:54,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-11 21:22:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:54,816 INFO L225 Difference]: With dead ends: 323 [2019-01-11 21:22:54,816 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 21:22:54,820 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-11 21:22:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 21:22:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-01-11 21:22:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-11 21:22:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2019-01-11 21:22:54,871 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2019-01-11 21:22:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:54,872 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2019-01-11 21:22:54,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2019-01-11 21:22:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:22:54,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:54,874 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] [2019-01-11 21:22:54,874 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2019-01-11 21:22:54,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:54,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:54,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:54,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:54,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:54,960 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-11 21:22:54,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:54,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:54,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:54,964 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2019-01-11 21:22:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:55,310 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2019-01-11 21:22:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:55,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:22:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:55,313 INFO L225 Difference]: With dead ends: 330 [2019-01-11 21:22:55,313 INFO L226 Difference]: Without dead ends: 181 [2019-01-11 21:22:55,315 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-11 21:22:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-11 21:22:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-01-11 21:22:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-11 21:22:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2019-01-11 21:22:55,332 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2019-01-11 21:22:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:55,332 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2019-01-11 21:22:55,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2019-01-11 21:22:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:22:55,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:55,334 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] [2019-01-11 21:22:55,334 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2019-01-11 21:22:55,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:55,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:55,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:55,408 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-11 21:22:55,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:55,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:55,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:55,410 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2019-01-11 21:22:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:55,759 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2019-01-11 21:22:55,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:55,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:22:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:55,763 INFO L225 Difference]: With dead ends: 361 [2019-01-11 21:22:55,763 INFO L226 Difference]: Without dead ends: 189 [2019-01-11 21:22:55,765 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-11 21:22:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-11 21:22:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-01-11 21:22:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 21:22:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2019-01-11 21:22:55,783 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2019-01-11 21:22:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:55,783 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2019-01-11 21:22:55,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2019-01-11 21:22:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:22:55,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:55,786 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] [2019-01-11 21:22:55,786 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2019-01-11 21:22:55,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:55,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:55,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:55,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:55,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:55,868 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-11 21:22:55,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:55,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:55,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:55,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:55,870 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2019-01-11 21:22:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:56,161 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2019-01-11 21:22:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:56,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:22:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:56,164 INFO L225 Difference]: With dead ends: 366 [2019-01-11 21:22:56,164 INFO L226 Difference]: Without dead ends: 188 [2019-01-11 21:22:56,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-11 21:22:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-11 21:22:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-01-11 21:22:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 21:22:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-01-11 21:22:56,180 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2019-01-11 21:22:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:56,180 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-01-11 21:22:56,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-01-11 21:22:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:22:56,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:56,182 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] [2019-01-11 21:22:56,182 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:56,182 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2019-01-11 21:22:56,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:56,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:56,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:56,228 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-11 21:22:56,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:56,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:56,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:56,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:56,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:56,232 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2019-01-11 21:22:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:56,589 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2019-01-11 21:22:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:56,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:22:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:56,592 INFO L225 Difference]: With dead ends: 377 [2019-01-11 21:22:56,592 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 21:22:56,593 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-11 21:22:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 21:22:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-01-11 21:22:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 21:22:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2019-01-11 21:22:56,625 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2019-01-11 21:22:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:56,626 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2019-01-11 21:22:56,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2019-01-11 21:22:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:22:56,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:56,629 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] [2019-01-11 21:22:56,630 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2019-01-11 21:22:56,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:56,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:56,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:56,707 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-11 21:22:56,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:56,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:56,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:56,709 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2019-01-11 21:22:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:57,016 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2019-01-11 21:22:57,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:57,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-11 21:22:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:57,019 INFO L225 Difference]: With dead ends: 377 [2019-01-11 21:22:57,019 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 21:22:57,020 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-11 21:22:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 21:22:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-01-11 21:22:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 21:22:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2019-01-11 21:22:57,029 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2019-01-11 21:22:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:57,029 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2019-01-11 21:22:57,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2019-01-11 21:22:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:22:57,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:57,031 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] [2019-01-11 21:22:57,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2019-01-11 21:22:57,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:57,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:57,092 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-11 21:22:57,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:57,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:57,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:57,093 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2019-01-11 21:22:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:57,246 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2019-01-11 21:22:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:57,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:22:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:57,253 INFO L225 Difference]: With dead ends: 377 [2019-01-11 21:22:57,253 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 21:22:57,254 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-11 21:22:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 21:22:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-01-11 21:22:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 21:22:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2019-01-11 21:22:57,266 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2019-01-11 21:22:57,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:57,267 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2019-01-11 21:22:57,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2019-01-11 21:22:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:22:57,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:57,272 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] [2019-01-11 21:22:57,272 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2019-01-11 21:22:57,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:57,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:57,352 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-11 21:22:57,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:57,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:22:57,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:57,356 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2019-01-11 21:22:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:57,388 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2019-01-11 21:22:57,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:57,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:22:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:57,393 INFO L225 Difference]: With dead ends: 536 [2019-01-11 21:22:57,394 INFO L226 Difference]: Without dead ends: 357 [2019-01-11 21:22:57,395 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-11 21:22:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-11 21:22:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2019-01-11 21:22:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-01-11 21:22:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-01-11 21:22:57,414 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2019-01-11 21:22:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:57,414 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-01-11 21:22:57,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-01-11 21:22:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:22:57,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:57,416 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-11 21:22:57,416 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2019-01-11 21:22:57,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:57,512 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-11 21:22:57,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:57,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:22:57,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:22:57,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:22:57,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:22:57,513 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-01-11 21:22:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:59,026 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2019-01-11 21:22:59,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:22:59,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-01-11 21:22:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:59,032 INFO L225 Difference]: With dead ends: 1099 [2019-01-11 21:22:59,033 INFO L226 Difference]: Without dead ends: 752 [2019-01-11 21:22:59,034 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-11 21:22:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-01-11 21:22:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2019-01-11 21:22:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-01-11 21:22:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2019-01-11 21:22:59,063 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2019-01-11 21:22:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:59,064 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2019-01-11 21:22:59,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:22:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2019-01-11 21:22:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-11 21:22:59,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:59,067 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] [2019-01-11 21:22:59,067 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2019-01-11 21:22:59,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:59,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:59,182 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-11 21:22:59,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:59,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:59,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:59,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:59,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:59,185 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2019-01-11 21:23:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:00,055 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2019-01-11 21:23:00,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:00,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-01-11 21:23:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:00,063 INFO L225 Difference]: With dead ends: 1330 [2019-01-11 21:23:00,063 INFO L226 Difference]: Without dead ends: 740 [2019-01-11 21:23:00,066 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-11 21:23:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-01-11 21:23:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2019-01-11 21:23:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-11 21:23:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2019-01-11 21:23:00,108 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2019-01-11 21:23:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:00,110 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2019-01-11 21:23:00,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2019-01-11 21:23:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 21:23:00,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:00,112 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] [2019-01-11 21:23:00,113 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2019-01-11 21:23:00,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:00,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:00,200 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-11 21:23:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:00,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:00,204 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2019-01-11 21:23:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:01,294 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2019-01-11 21:23:01,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:01,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-11 21:23:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:01,302 INFO L225 Difference]: With dead ends: 1497 [2019-01-11 21:23:01,303 INFO L226 Difference]: Without dead ends: 785 [2019-01-11 21:23:01,304 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-11 21:23:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-01-11 21:23:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2019-01-11 21:23:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-01-11 21:23:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2019-01-11 21:23:01,337 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2019-01-11 21:23:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:01,338 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2019-01-11 21:23:01,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2019-01-11 21:23:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:23:01,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:01,341 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:23:01,341 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2019-01-11 21:23:01,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:01,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:01,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:01,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:01,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:01,414 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2019-01-11 21:23:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:01,447 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2019-01-11 21:23:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:01,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:23:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:01,453 INFO L225 Difference]: With dead ends: 1522 [2019-01-11 21:23:01,453 INFO L226 Difference]: Without dead ends: 765 [2019-01-11 21:23:01,455 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-11 21:23:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-01-11 21:23:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-01-11 21:23:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-01-11 21:23:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2019-01-11 21:23:01,484 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2019-01-11 21:23:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:01,484 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2019-01-11 21:23:01,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2019-01-11 21:23:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:23:01,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:01,487 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:23:01,487 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2019-01-11 21:23:01,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:01,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:01,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:01,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:01,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:01,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:01,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:01,586 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2019-01-11 21:23:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:01,758 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2019-01-11 21:23:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:01,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:23:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:01,765 INFO L225 Difference]: With dead ends: 1536 [2019-01-11 21:23:01,766 INFO L226 Difference]: Without dead ends: 779 [2019-01-11 21:23:01,767 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-11 21:23:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-01-11 21:23:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2019-01-11 21:23:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-01-11 21:23:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2019-01-11 21:23:01,795 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2019-01-11 21:23:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:01,796 INFO L480 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2019-01-11 21:23:01,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2019-01-11 21:23:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-11 21:23:01,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:01,798 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:23:01,798 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2019-01-11 21:23:01,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:01,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:01,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:01,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:01,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:01,873 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2019-01-11 21:23:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:01,934 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2019-01-11 21:23:01,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:01,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-11 21:23:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:01,944 INFO L225 Difference]: With dead ends: 2298 [2019-01-11 21:23:01,945 INFO L226 Difference]: Without dead ends: 1529 [2019-01-11 21:23:01,947 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-11 21:23:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-01-11 21:23:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2019-01-11 21:23:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-01-11 21:23:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2019-01-11 21:23:02,008 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2019-01-11 21:23:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:02,009 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2019-01-11 21:23:02,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2019-01-11 21:23:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-11 21:23:02,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:02,014 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:23:02,014 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2019-01-11 21:23:02,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:02,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:02,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:02,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:02,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:02,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:02,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:02,096 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2019-01-11 21:23:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:02,494 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2019-01-11 21:23:02,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:02,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-11 21:23:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:02,501 INFO L225 Difference]: With dead ends: 2638 [2019-01-11 21:23:02,502 INFO L226 Difference]: Without dead ends: 1430 [2019-01-11 21:23:02,504 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-11 21:23:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-01-11 21:23:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2019-01-11 21:23:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-01-11 21:23:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2019-01-11 21:23:02,570 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2019-01-11 21:23:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:02,571 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2019-01-11 21:23:02,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2019-01-11 21:23:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 21:23:02,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:02,576 INFO L402 BasicCegarLoop]: trace histogram [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-11 21:23:02,576 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2019-01-11 21:23:02,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:02,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:02,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:23:02,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:02,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:02,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:02,659 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2019-01-11 21:23:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:02,778 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2019-01-11 21:23:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:02,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-01-11 21:23:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:02,788 INFO L225 Difference]: With dead ends: 2486 [2019-01-11 21:23:02,788 INFO L226 Difference]: Without dead ends: 1659 [2019-01-11 21:23:02,791 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-11 21:23:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-01-11 21:23:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2019-01-11 21:23:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-01-11 21:23:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2019-01-11 21:23:02,879 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2019-01-11 21:23:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:02,879 INFO L480 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2019-01-11 21:23:02,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2019-01-11 21:23:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 21:23:02,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:02,882 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:02,882 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:02,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2019-01-11 21:23:02,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:02,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:03,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:03,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:03,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:03,017 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2019-01-11 21:23:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:03,191 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2019-01-11 21:23:03,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:03,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-11 21:23:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:03,202 INFO L225 Difference]: With dead ends: 3421 [2019-01-11 21:23:03,202 INFO L226 Difference]: Without dead ends: 2245 [2019-01-11 21:23:03,205 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-11 21:23:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-01-11 21:23:03,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-01-11 21:23:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-01-11 21:23:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2019-01-11 21:23:03,298 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2019-01-11 21:23:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:03,298 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2019-01-11 21:23:03,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2019-01-11 21:23:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 21:23:03,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:03,304 INFO L402 BasicCegarLoop]: trace histogram [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-11 21:23:03,304 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2019-01-11 21:23:03,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:23:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:23:03,378 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:23:03,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:23:03 BoogieIcfgContainer [2019-01-11 21:23:03,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:23:03,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:23:03,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:23:03,454 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:23:03,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:53" (3/4) ... [2019-01-11 21:23:03,459 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:23:03,599 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:23:03,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:23:03,604 INFO L168 Benchmark]: Toolchain (without parser) took 12102.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -217.2 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:03,606 INFO L168 Benchmark]: CDTParser took 0.15 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-11 21:23:03,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:03,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:03,608 INFO L168 Benchmark]: Boogie Preprocessor took 45.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:23:03,609 INFO L168 Benchmark]: RCFGBuilder took 1436.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:03,610 INFO L168 Benchmark]: TraceAbstraction took 9944.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.5 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:03,610 INFO L168 Benchmark]: Witness Printer took 149.59 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: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:03,613 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.15 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 386.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1436.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9944.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.5 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Witness Printer took 149.59 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: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 641]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L646] int s ; [L647] int tmp ; [L651] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 ; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__s3__tmp__reuse_message = 0 [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND TRUE tmp___1 + 12288 [L91] COND TRUE tmp___2 + 16384 [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L603] COND TRUE ! s__s3__tmp__reuse_message [L604] COND TRUE ! skip [L605] COND TRUE tmp___1 != -12288 [L606] COND TRUE s__state != 8656 [L607] COND TRUE tmp___2 != -16384 [L608] COND FALSE !(state == 8496) [L615] COND FALSE !(\read(s__debug)) [L621] COND TRUE cb != 0 [L622] COND TRUE s__state != state [L623] new_state = s__state [L624] s__state = state [L625] s__state = new_state [L630] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L603] COND TRUE ! s__s3__tmp__reuse_message [L604] COND TRUE ! skip [L605] COND TRUE tmp___1 != -12288 [L606] COND TRUE s__state != 8656 [L607] COND TRUE tmp___2 != -16384 [L608] COND TRUE state == 8496 [L641] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. UNSAFE Result, 9.8s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3434 SDtfs, 3298 SDslu, 1317 SDs, 0 SdLazy, 1077 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 70785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 102/102 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...