./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 2e94e6aa 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-2e94e6a [2018-12-30 16:08:04,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:08:04,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:08:04,337 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:08:04,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:08:04,339 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:08:04,340 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:08:04,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:08:04,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:08:04,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:08:04,345 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:08:04,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:08:04,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:08:04,347 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:08:04,348 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:08:04,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:08:04,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:08:04,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:08:04,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:08:04,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:08:04,357 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:08:04,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:08:04,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:08:04,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:08:04,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:08:04,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:08:04,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:08:04,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:08:04,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:08:04,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:08:04,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:08:04,371 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:08:04,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:08:04,375 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:08:04,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:08:04,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:08:04,378 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:08:04,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:08:04,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:08:04,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:08:04,415 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:08:04,415 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:08:04,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:08:04,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:08:04,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:08:04,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:08:04,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:08:04,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:08:04,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:08:04,417 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:08:04,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:08:04,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:08:04,418 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:08:04,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:08:04,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:08:04,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:08:04,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:08:04,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:08:04,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:08:04,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:08:04,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:08:04,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:08:04,422 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:08:04,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:08:04,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:08:04,423 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 [2018-12-30 16:08:04,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:08:04,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:08:04,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:08:04,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:08:04,521 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:08:04,522 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 [2018-12-30 16:08:04,586 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b4f76d6/46773e550e0049b18726e835c758c862/FLAGe82aa9c7c [2018-12-30 16:08:05,059 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:08:05,060 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_14_false-unreach-call_false-termination.cil.c [2018-12-30 16:08:05,080 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b4f76d6/46773e550e0049b18726e835c758c862/FLAGe82aa9c7c [2018-12-30 16:08:05,371 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b4f76d6/46773e550e0049b18726e835c758c862 [2018-12-30 16:08:05,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:08:05,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:08:05,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:05,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:08:05,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:08:05,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:05,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499f4833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05, skipping insertion in model container [2018-12-30 16:08:05,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:05,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:08:05,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:08:05,822 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:05,830 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:08:05,901 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:05,920 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:08:05,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05 WrapperNode [2018-12-30 16:08:05,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:05,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:05,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:08:05,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:08:06,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:06,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:08:06,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:08:06,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:08:06,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (1/1) ... [2018-12-30 16:08:06,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:08:06,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:08:06,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:08:06,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:08:06,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (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 [2018-12-30 16:08:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:08:06,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:08:06,328 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:08:06,329 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:08:07,521 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:08:07,521 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:08:07,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:07 BoogieIcfgContainer [2018-12-30 16:08:07,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:08:07,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:08:07,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:08:07,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:08:07,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:08:05" (1/3) ... [2018-12-30 16:08:07,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a12e2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:07, skipping insertion in model container [2018-12-30 16:08:07,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:05" (2/3) ... [2018-12-30 16:08:07,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a12e2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:07, skipping insertion in model container [2018-12-30 16:08:07,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:07" (3/3) ... [2018-12-30 16:08:07,530 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_14_false-unreach-call_false-termination.cil.c [2018-12-30 16:08:07,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:08:07,550 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:08:07,566 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:08:07,604 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:08:07,605 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:08:07,605 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:08:07,605 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:08:07,605 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:08:07,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:08:07,606 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:08:07,606 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:08:07,606 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:08:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-12-30 16:08:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:08:07,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:07,635 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] [2018-12-30 16:08:07,637 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2018-12-30 16:08:07,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:07,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:07,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:07,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:07,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:07,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:07,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:07,967 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2018-12-30 16:08:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:08,717 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2018-12-30 16:08:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:08,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:08:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:08,736 INFO L225 Difference]: With dead ends: 323 [2018-12-30 16:08:08,737 INFO L226 Difference]: Without dead ends: 160 [2018-12-30 16:08:08,741 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 [2018-12-30 16:08:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-30 16:08:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-12-30 16:08:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-30 16:08:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2018-12-30 16:08:08,798 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2018-12-30 16:08:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:08,798 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2018-12-30 16:08:08,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2018-12-30 16:08:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:08:08,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:08,802 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] [2018-12-30 16:08:08,803 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2018-12-30 16:08:08,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:08,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:08,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:08,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:08,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:08,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:08,877 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2018-12-30 16:08:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:09,192 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2018-12-30 16:08:09,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:09,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:08:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:09,198 INFO L225 Difference]: With dead ends: 330 [2018-12-30 16:08:09,199 INFO L226 Difference]: Without dead ends: 181 [2018-12-30 16:08:09,201 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 [2018-12-30 16:08:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-30 16:08:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-12-30 16:08:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-30 16:08:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2018-12-30 16:08:09,232 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2018-12-30 16:08:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:09,232 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2018-12-30 16:08:09,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2018-12-30 16:08:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:08:09,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:09,234 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] [2018-12-30 16:08:09,234 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2018-12-30 16:08:09,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:09,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:09,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:09,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:09,331 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2018-12-30 16:08:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:09,672 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2018-12-30 16:08:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:08:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:09,675 INFO L225 Difference]: With dead ends: 361 [2018-12-30 16:08:09,675 INFO L226 Difference]: Without dead ends: 189 [2018-12-30 16:08:09,677 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 [2018-12-30 16:08:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-30 16:08:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-12-30 16:08:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-30 16:08:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2018-12-30 16:08:09,693 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2018-12-30 16:08:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:09,693 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2018-12-30 16:08:09,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2018-12-30 16:08:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:08:09,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:09,696 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] [2018-12-30 16:08:09,696 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2018-12-30 16:08:09,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:09,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:09,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:09,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:09,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:09,814 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2018-12-30 16:08:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:10,105 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2018-12-30 16:08:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:10,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:08:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:10,107 INFO L225 Difference]: With dead ends: 366 [2018-12-30 16:08:10,107 INFO L226 Difference]: Without dead ends: 188 [2018-12-30 16:08:10,108 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 [2018-12-30 16:08:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-30 16:08:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-12-30 16:08:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2018-12-30 16:08:10,122 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2018-12-30 16:08:10,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:10,122 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2018-12-30 16:08:10,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2018-12-30 16:08:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:08:10,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:10,124 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] [2018-12-30 16:08:10,124 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2018-12-30 16:08:10,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:10,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:10,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:10,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:10,172 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2018-12-30 16:08:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:10,563 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2018-12-30 16:08:10,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:10,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:08:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:10,565 INFO L225 Difference]: With dead ends: 377 [2018-12-30 16:08:10,565 INFO L226 Difference]: Without dead ends: 198 [2018-12-30 16:08:10,567 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 [2018-12-30 16:08:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-30 16:08:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-12-30 16:08:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2018-12-30 16:08:10,588 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2018-12-30 16:08:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:10,589 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2018-12-30 16:08:10,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2018-12-30 16:08:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:08:10,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:10,590 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] [2018-12-30 16:08:10,591 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2018-12-30 16:08:10,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:10,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:10,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:10,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:10,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:10,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:10,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:10,669 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2018-12-30 16:08:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,228 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2018-12-30 16:08:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:08:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,230 INFO L225 Difference]: With dead ends: 377 [2018-12-30 16:08:11,230 INFO L226 Difference]: Without dead ends: 198 [2018-12-30 16:08:11,231 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 [2018-12-30 16:08:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-30 16:08:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-12-30 16:08:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2018-12-30 16:08:11,240 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2018-12-30 16:08:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,241 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2018-12-30 16:08:11,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2018-12-30 16:08:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:08:11,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,243 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] [2018-12-30 16:08:11,244 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2018-12-30 16:08:11,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:11,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:11,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:11,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:11,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:11,341 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2018-12-30 16:08:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,503 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2018-12-30 16:08:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:08:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,506 INFO L225 Difference]: With dead ends: 377 [2018-12-30 16:08:11,508 INFO L226 Difference]: Without dead ends: 198 [2018-12-30 16:08:11,509 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 [2018-12-30 16:08:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-30 16:08:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-12-30 16:08:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2018-12-30 16:08:11,519 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2018-12-30 16:08:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,520 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2018-12-30 16:08:11,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2018-12-30 16:08:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:08:11,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,523 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] [2018-12-30 16:08:11,523 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2018-12-30 16:08:11,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:11,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:11,604 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2018-12-30 16:08:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:11,652 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2018-12-30 16:08:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:11,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:08:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:11,656 INFO L225 Difference]: With dead ends: 536 [2018-12-30 16:08:11,656 INFO L226 Difference]: Without dead ends: 357 [2018-12-30 16:08:11,658 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 [2018-12-30 16:08:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-12-30 16:08:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2018-12-30 16:08:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-30 16:08:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2018-12-30 16:08:11,677 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2018-12-30 16:08:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:11,678 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2018-12-30 16:08:11,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2018-12-30 16:08:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:08:11,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:11,681 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] [2018-12-30 16:08:11,682 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2018-12-30 16:08:11,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:11,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:11,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:11,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:11,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:11,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:11,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:11,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:11,775 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2018-12-30 16:08:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:13,585 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2018-12-30 16:08:13,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:08:13,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-30 16:08:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:13,590 INFO L225 Difference]: With dead ends: 1099 [2018-12-30 16:08:13,591 INFO L226 Difference]: Without dead ends: 752 [2018-12-30 16:08:13,592 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 [2018-12-30 16:08:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-12-30 16:08:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2018-12-30 16:08:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-12-30 16:08:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2018-12-30 16:08:13,622 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2018-12-30 16:08:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:13,624 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2018-12-30 16:08:13,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2018-12-30 16:08:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-30 16:08:13,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:13,631 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] [2018-12-30 16:08:13,631 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2018-12-30 16:08:13,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:13,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:13,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:13,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:13,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:13,721 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2018-12-30 16:08:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:14,697 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2018-12-30 16:08:14,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:14,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-30 16:08:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:14,703 INFO L225 Difference]: With dead ends: 1330 [2018-12-30 16:08:14,704 INFO L226 Difference]: Without dead ends: 740 [2018-12-30 16:08:14,705 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 [2018-12-30 16:08:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-12-30 16:08:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2018-12-30 16:08:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-12-30 16:08:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2018-12-30 16:08:14,737 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2018-12-30 16:08:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:14,738 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2018-12-30 16:08:14,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2018-12-30 16:08:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-30 16:08:14,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:14,741 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] [2018-12-30 16:08:14,742 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2018-12-30 16:08:14,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:14,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:14,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:14,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:14,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:14,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:14,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:14,800 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2018-12-30 16:08:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:15,430 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2018-12-30 16:08:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:15,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-30 16:08:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:15,435 INFO L225 Difference]: With dead ends: 1497 [2018-12-30 16:08:15,435 INFO L226 Difference]: Without dead ends: 785 [2018-12-30 16:08:15,437 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 [2018-12-30 16:08:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-12-30 16:08:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2018-12-30 16:08:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-30 16:08:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2018-12-30 16:08:15,464 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2018-12-30 16:08:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:15,466 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2018-12-30 16:08:15,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2018-12-30 16:08:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-30 16:08:15,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:15,468 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] [2018-12-30 16:08:15,469 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2018-12-30 16:08:15,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:15,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:15,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:15,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:15,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:15,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:15,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:15,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:15,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:15,535 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2018-12-30 16:08:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:15,573 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2018-12-30 16:08:15,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:15,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-30 16:08:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:15,578 INFO L225 Difference]: With dead ends: 1522 [2018-12-30 16:08:15,579 INFO L226 Difference]: Without dead ends: 765 [2018-12-30 16:08:15,580 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 [2018-12-30 16:08:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-12-30 16:08:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2018-12-30 16:08:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-30 16:08:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2018-12-30 16:08:15,607 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2018-12-30 16:08:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:15,608 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2018-12-30 16:08:15,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2018-12-30 16:08:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 16:08:15,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:15,611 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] [2018-12-30 16:08:15,611 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2018-12-30 16:08:15,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:15,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:15,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:15,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:15,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:15,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:15,691 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2018-12-30 16:08:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:15,847 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2018-12-30 16:08:15,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:15,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-30 16:08:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:15,853 INFO L225 Difference]: With dead ends: 1536 [2018-12-30 16:08:15,853 INFO L226 Difference]: Without dead ends: 779 [2018-12-30 16:08:15,854 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 [2018-12-30 16:08:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-12-30 16:08:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2018-12-30 16:08:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-12-30 16:08:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2018-12-30 16:08:15,884 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2018-12-30 16:08:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:15,884 INFO L480 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2018-12-30 16:08:15,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2018-12-30 16:08:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-30 16:08:15,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:15,888 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] [2018-12-30 16:08:15,888 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:15,888 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2018-12-30 16:08:15,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:15,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:15,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:15,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:15,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:15,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:15,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:15,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:15,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:15,965 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2018-12-30 16:08:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:16,075 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2018-12-30 16:08:16,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:16,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-30 16:08:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:16,085 INFO L225 Difference]: With dead ends: 2298 [2018-12-30 16:08:16,085 INFO L226 Difference]: Without dead ends: 1529 [2018-12-30 16:08:16,087 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 [2018-12-30 16:08:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-12-30 16:08:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2018-12-30 16:08:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-12-30 16:08:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2018-12-30 16:08:16,142 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2018-12-30 16:08:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:16,143 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2018-12-30 16:08:16,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2018-12-30 16:08:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-30 16:08:16,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:16,147 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] [2018-12-30 16:08:16,147 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2018-12-30 16:08:16,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:16,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:16,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:16,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:16,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:16,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:16,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:16,232 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2018-12-30 16:08:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:16,975 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2018-12-30 16:08:16,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:16,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-30 16:08:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:16,985 INFO L225 Difference]: With dead ends: 2638 [2018-12-30 16:08:16,985 INFO L226 Difference]: Without dead ends: 1430 [2018-12-30 16:08:16,988 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 [2018-12-30 16:08:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-12-30 16:08:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2018-12-30 16:08:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-12-30 16:08:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2018-12-30 16:08:17,052 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2018-12-30 16:08:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:17,052 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2018-12-30 16:08:17,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2018-12-30 16:08:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-30 16:08:17,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:17,057 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] [2018-12-30 16:08:17,057 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2018-12-30 16:08:17,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:08:17,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:17,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:17,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:17,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:17,123 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2018-12-30 16:08:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:17,237 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2018-12-30 16:08:17,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:17,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-30 16:08:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:17,246 INFO L225 Difference]: With dead ends: 2486 [2018-12-30 16:08:17,246 INFO L226 Difference]: Without dead ends: 1659 [2018-12-30 16:08:17,248 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 [2018-12-30 16:08:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-12-30 16:08:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2018-12-30 16:08:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-12-30 16:08:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2018-12-30 16:08:17,297 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2018-12-30 16:08:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:17,297 INFO L480 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2018-12-30 16:08:17,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2018-12-30 16:08:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-30 16:08:17,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:17,301 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] [2018-12-30 16:08:17,302 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2018-12-30 16:08:17,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:17,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:17,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:17,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:17,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:17,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:17,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:17,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:17,462 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2018-12-30 16:08:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:17,646 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2018-12-30 16:08:17,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:17,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-30 16:08:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:17,659 INFO L225 Difference]: With dead ends: 3421 [2018-12-30 16:08:17,659 INFO L226 Difference]: Without dead ends: 2245 [2018-12-30 16:08:17,662 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 [2018-12-30 16:08:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2018-12-30 16:08:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2018-12-30 16:08:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2018-12-30 16:08:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2018-12-30 16:08:17,752 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2018-12-30 16:08:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:17,752 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2018-12-30 16:08:17,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2018-12-30 16:08:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-30 16:08:17,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:17,758 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] [2018-12-30 16:08:17,758 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:17,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2018-12-30 16:08:17,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:08:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:08:17,829 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:08:17,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:08:17 BoogieIcfgContainer [2018-12-30 16:08:17,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:08:17,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:08:17,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:08:17,923 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:08:17,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:07" (3/4) ... [2018-12-30 16:08:17,928 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 16:08:18,066 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:08:18,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:08:18,071 INFO L168 Benchmark]: Toolchain (without parser) took 12696.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 267.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:18,073 INFO L168 Benchmark]: CDTParser took 0.20 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. [2018-12-30 16:08:18,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.74 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. [2018-12-30 16:08:18,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:18,074 INFO L168 Benchmark]: Boogie Preprocessor took 43.02 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. [2018-12-30 16:08:18,074 INFO L168 Benchmark]: RCFGBuilder took 1410.16 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:18,077 INFO L168 Benchmark]: TraceAbstraction took 10399.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.2 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:18,077 INFO L168 Benchmark]: Witness Printer took 147.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:18,080 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.20 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 542.74 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 147.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.02 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 1410.16 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10399.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.2 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * Witness Printer took 147.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 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, 152 locations, 1 error locations. UNSAFE Result, 10.3s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 7.7s 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.4s 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.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s 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...